Properties of the Number 12954

Twelve Thousand Nine Hundred Fifty-Four

Basics

Value: 12953 → 12954 → 12955

Parity: even

Prime: No

Previous Prime: 12953

Next Prime: 12959

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 17 × 127

Divisors: 1, 2, 3, 6, 17, 34, 51, 102, 127, 254

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001010011010

Octal: 31232

Duodecimal: 75B6

Hexadecimal: 329a

Square: 167806116

Square Root: 113.81564040148436

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

Number A(n,k) of partitions of n where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order; square array A(n,k), n>=0, k>=0, read by antidiagonals. A261718

Numbers n such that p(9n) is prime, where p(n) is the number of partitions of n. A114169

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock having a single 1 or two 1s on the same edge or main diagonally. A251292

T(n,k)=Number of nXk 0,1 arrays indicating 2X2 subblocks of some larger (n+1)X(k+1) binary array having a sum of zero, with rows and columns of the latter in lexicographically nondecreasing order. A227125

Start with 83; if even, divide by 2; if odd, add next three primes: Orbit of 83 under iterations of A174221, the "PrimeLatz" map. A293979

T(n,k) = count of degree k monomials in the complete homogeneous symmetric polynomials h(μ,k) summed over all partitions μ of n. A209666

Fibonacci sequence beginning 2, 20. A22372

Integers expressible as the sum of (at least two) consecutive primes in at least 4 ways. A67374

a(n) = sum of n successive primes after the n-th prime. A131740

a(n) = ∑_k=0..n binomial(2^k + n-k-1, n-k); equals the row sums of triangle A137153. A137154