Properties of the Number 12502

Twelve Thousand Five Hundred Two

Basics

Value: 12501 → 12502 → 12503

Parity: even

Prime: No

Previous Prime: 12497

Next Prime: 12503

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 × 7 × 19 × 47

Divisors: 1, 2, 7, 14, 19, 38, 47, 94, 133, 266

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11000011010110

Octal: 30326

Duodecimal: 729A

Hexadecimal: 30d6

Square: 156300004

Square Root: 111.81234278915723

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 T(n,k) of defective (binary) heaps on n elements with k defects; triangle T(n,k), n>=0, 0<=k<=max(0,n-1), read by rows. A306343

Starting from generation 8 add previous and next term yielding generation 9. A48455

The Berndt-type sequence number 9 for the argument 2*π/13. A211988

Numbers divisible by the sum of 4th powers of their digits. A169665

a(0) = 1, a(n) = 20·n² + 2 for n>0. A10010

Triangle where g.f. of row n = ∏_i=0..n [F(i+1) + F(i)*x] for n>=0, where F(i) = A000045(i) is the i-th Fibonacci number. A130405

[s(k)-s(j)]/6, where the pairs (k,j) are given by A205857 and A205858, and s(k) denotes the (k+1)-st Fibonacci number. A205860

Number of n-step walks (each step +-1 starting from 0) which are never more than 5 or less than -5. A216241

Numbers of isomers of unbranched a-4-catapolyoctagons - see Brunvoll reference for precise definition. A121145

Column 1 of triangle A130405. A130406