Properties of the Number 12644

Twelve Thousand Six Hundred Forty-Four

Basics

Value: 12643 → 12644 → 12645

Parity: even

Prime: No

Previous Prime: 12641

Next Prime: 12647

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 29 × 109

Divisors: 1, 2, 4, 29, 58, 109, 116, 218, 436, 3161

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11000101100100

Octal: 30544

Duodecimal: 7398

Hexadecimal: 3164

Square: 159870736

Square Root: 112.44554237496477

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

The partition function G(n,3). A1680

Number G(n,k) of set partitions of {1,...,n} into sets of size at most k; triangle G(n,k), n>=0, 0<=k<=n, read by rows. A229223

a(n) = floor(n*φ¹⁴), where φ is the golden ratio, A001622. A4929

Expansion of ∏_k>=1 1/(1-x^3·k-1)^k. A262876

T(n,k)=Number of (n·k)Xk binary arrays with rows in nonincreasing order, n ones in every column and no more than 3 ones in any row. A188416

T(n,k)=Number of length n+4 0..k arrays with every five consecutive terms having two times the sum of some three elements equal to three times the sum of the remaining two. A248987

Number A(n,k) of set partitions of {1,...,k·n} into sets of size at most n; square array A(n,k), n>=0, k>=0, read by antidiagonals. A229243

Number of terms in n-th derivative of a function composed with itself 8 times. A24208

T(n,k) = Number of (n·k) X k binary arrays with nonzero rows in decreasing order, no more than 3 ones in any row and exactly n ones in every column. A188449

Number of Dyck n-paths all of whose ascents have prime lengths. A210737