Properties of the Number 12470

Twelve Thousand Four Hundred Seventy

Basics

Value: 12469 → 12470 → 12471

Parity: even

Prime: No

Previous Prime: 12457

Next Prime: 12473

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 5 × 29 × 43

Divisors: 1, 2, 5, 10, 29, 43, 58, 86, 145, 215

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 11000010110110

Octal: 30266

Duodecimal: 7272

Hexadecimal: 30b6

Square: 155500900

Square Root: 111.66915420114903

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

a(n) is the number of subsets of {1,...,n} containing no solutions to x+y=z with·and y distinct (one version of "sum-free subsets"). A85489

Partial sums of A299266. A299267

Pairs (j, k) of numbers j<k such that φ(j) = φ(k), σ(j) = σ(k), d(j) = d(k). A134922

Expansion of 1/(1 - x² - x⁷ - x¹² + x¹⁴) (a Salem polynomial). A143619

Number of distinct values taken by 7⁷^...⁷ (with n 7's and parentheses inserted in all possible ways). A145547

Two-column table read by rows: Primitive distinct pairs that have the same value of φ, σ, and τ. A322688

Triangle, read by rows, equal to the matrix inverse of P=A113370. A114156

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively. A203728

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 4,4,0,2,1 for x=0,1,2,3,4. A197307

Number of partitions of n containing m(1) as a part, where m denotes multiplicity. A240486