Properties of the Number 12870

Twelve Thousand Eight Hundred Seventy

Basics

Value: 12869 → 12870 → 12871

Parity: even

Prime: No

Previous Prime: 12853

Next Prime: 12889

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 5 × 11 × 13

Divisors: 1, 2, 3, 5, 6, 9, 10, 11, 13, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001001000110

Octal: 31106

Duodecimal: 7546

Hexadecimal: 3246

Square: 165636900

Square Root: 113.44602240713422

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

Central binomial coefficients: binomial(2·n,n) = (2·n)!/(n!)². A984

a(n) = binomial(n, floor(n/2)). A1405

Swinging factorial, a(n) = 2^{n-(n mod 2})*∏_k=1..n k^(-1^(k+1)). A56040

a(n) = ∑_{k = 0..n} binomial(n,floor(k/2))*(-1)^n-k. A126869

Numbers n such that n = product (p_k)^c_k and set of its (c_k k's)'s is a self-conjugate partition, where p_k is k-th prime and c_k > 0. A88902

T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows. A63007

a(n) = binomial coefficient C(n,8). A581

a(n) = binomial(4n,2n) or (4·n)!/((2·n)!*(2·n)!). A1448

Array T(i,j) = binomial(-1/2-i,j)*(-4)^j, i,j >= 0 read by antidiagonals going down. A46521

Number of n-step walks on a line starting from the origin but not returning to it. A63886