Properties of the Number 15764

Fifteen Thousand Seven Hundred Sixty-Four

Basics

Value: 15763 → 15764 → 15765

Parity: even

Prime: No

Previous Prime: 15761

Next Prime: 15767

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 7 × 563

Divisors: 1, 2, 4, 7, 14, 28, 563, 1126, 2252, 3941

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11110110010100

Octal: 36624

Duodecimal: 9158

Hexadecimal: 3d94

Square: 248503696

Square Root: 125.55476892575606

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Total sum of the sums of all positive k-th ranks of all partitions of n. A208483

Conjecturally, number of infinitely recurring prime patterns of width 2n-1. A23189

a(n) = 686·n - 14. A157363

Triangle read by rows: T(n,k) number of ways of partitioning the (n+3)-element multiset {1,1,1,1,2,3,...,n} into exactly k nonempty parts, n >= 0 and 1 <= k <= n + 3. A291118

a(n) = T(2n,n-2), T given by A026670. A26673

Tribonacci equivalent of mousetrap sequence (A002467). A104470

Number of nX6 0..2 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 3. A240037

Number of (3+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 3 5 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 3 5 6 or 7. A252387

Length of period of continued fraction expansion of sqrt(3·2ⁿ). A294226

Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,4}. A79964