Properties of the Number 31252

Thirty-One Thousand Two Hundred Fifty-Two

Basics

Value: 31251 → 31252 → 31253

Parity: even

Prime: No

Previous Prime: 31249

Next Prime: 31253

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 13 × 601

Divisors: 1, 2, 4, 13, 26, 52, 601, 1202, 2404, 7813

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111101000010100

Octal: 75024

Duodecimal: 16104

Hexadecimal: 7a14

Square: 976687504

Square Root: 176.7823520603796

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

Numbers n such that there is no square n-gonal number greater than 1. A188896

Triangle read by rows: T(n,k) is the number of embeddings on the sphere of 2-connected planar graphs with n nodes and k faces up to orientation preserving isomorphisms, n >= 3, k=2..2·n-4. A342059

Expansion of (4 + 15·x - 35·x² + 20·x³ - 2·x⁵)/(1 - x)⁵. A257600

a(n) = (n⁴ + 20·n³ + 125·n² + 250·n + 24)/12. A257601

1/n! times the number of ordered pairs of permutation functions f,g on n elements where f(f(x)) = g(f(g(x))). A255515

G.f. = φ⁵*F, where φ = g.f. for A028930, F = g.f. for A028959. A328532

Number of nX4 0..1 arrays with every element equal to 0, 2, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A303238

Least k such that base 5 representation of n begins at s(k), where s=A031251. A31252

G.f.: A(x) = exp( ∑_n>=1 2*σ(n,n+1)*xⁿ/n ). A158265