Properties of the Number 12866

Twelve Thousand Eight Hundred Sixty-Six

Basics

Value: 12865 → 12866 → 12867

Parity: even

Prime: No

Previous Prime: 12853

Next Prime: 12889

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 7 × 919

Divisors: 1, 2, 7, 14, 919, 1838, 6433, 12866

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11001001000010

Octal: 31102

Duodecimal: 7542

Hexadecimal: 3242

Square: 165533956

Square Root: 113.4283915075939

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

a(n) = 2*(3ⁿ) - 2ⁿ. A27649

Array read by antidiagonals: poly-Bernoulli numbers B(-k,n). A99594

Number of partitions of n containing a clique of size 2. A183559

Base-3 Keith numbers. A188195

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the same number of equal diagonal or antidiagonal elements, and new values 0..2 introduced in row major order. A205361

Array defined by a(n,k) = floor((k+2)/2)*3ⁿ - floor((k+1)/2)*2ⁿ, read by antidiagonals. A217764

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock sum of the two medians of the diagonal and antidiagonal minus the sum of the minimums of the central row and column nondecreasing horizontally and vertically. A254989

Max_k=0..n { Number of partitions of n into exactly k parts }. A2569

G.f.: A(x,y) = ∑_n>=0,m>=0 (2^m-1)ⁿ*xⁿ * log(1+y)^m/m!. A163353

Expansion of exp( ∑_k>=1 binomial(8·k-1,2·k-1) * x^k/k ). A381751