Properties of the Number 12525

Twelve Thousand Five Hundred Twenty-Five

Basics

Value: 12524 → 12525 → 12526

Parity: odd

Prime: No

Previous Prime: 12517

Next Prime: 12527

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 ² × 167

Divisors: 1, 3, 5, 15, 25, 75, 167, 501, 835, 2505

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11000011101101

Octal: 30355

Duodecimal: 72B9

Hexadecimal: 30ed

Square: 156875625

Square Root: 111.91514642799696

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

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with all 2X2 subblock sums the same. A184003

Concatenation of n³ and n². A239461

a(n) = Fibonacci(n) mod n³. A132636

Expansion of (1/x) * Series_Reversion( x / ((1+x)³ * C(x)) ), where C(x) is the g.f. of A000108. A381882

Numbers k such that 1 + binomial(k,j) is prime for only 2 values of j (0 <= j <= k). A67317

Triangle read by rows: T(n,k) is the number of peakless Motzkin paths of length n containing k subwords of the type U H^j U or D H^j D for some j>0, where U=(1,1), H=(1,0) and D=(1,-1) (can be easily expressed using RNA secondary structure terminology). A97100

a(n) = ∑_k=0..n C(n,k)²*(n-k)!*k³. A105218

Number of partitions of n containing at least one part m-6 if m is the largest part. A212546

Least positive integer m such that m + n divides π(m)² + π(n)², where π(x) denotes the number of primes not exceeding x. A248044

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = ∑_j=0..n j^k * (n-j)! * binomial(n,j)². A341200