Properties of the Number 12501

Twelve Thousand Five Hundred One

Basics

Value: 12500 → 12501 → 12502

Parity: odd

Prime: No

Previous Prime: 12497

Next Prime: 12503

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 463

Divisors: 1, 3, 9, 27, 463, 1389, 4167, 12501

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 11000011010101

Octal: 30325

Duodecimal: 7299

Hexadecimal: 30d5

Square: 156275001

Square Root: 111.80787092150534

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

E.g.f. satisfies: A(x) = exp( x/(1 - x·A'(x)/A(x)) ). A182962

a(n) = ∑_d∣n dⁿ * φ(d), where φ(n) is the Euler totient function A000010(n). A226561

a(n) = (1/n!)*A001688(n). A94793

a(n) = 5·n² + 1. A212656

Number of distinct residues of xⁿ (mod n⁴), x=0..n⁴-1. A365101

Triangle T(n,k) read by rows: T(n,k) = (k-1)*T(n-1,k) + (n-k+2)*T(n-1, k-1), with T(n,1)=1, for 1 <= k <= n, n >= 1. A157011

a(n) = 20·n² + 1. A158493

a(n) = (n+8)*a(n-1) + (n-1)*a(n-2), a(-1)=0, a(0)=1. A176735

Square array A(n, k) = A048720(A065621(σ((2n-1)²)), σ((2k-1)²)), read by falling antidiagonals, (1,1), (1,2), (2,1), (1,3), (2,2), (3,1), etc. A379221

Number of fullerenes with 2n vertices (or carbon atoms), counting enantiomorphic pairs as distinct. A57210