Properties of the Number 25231

Twenty-Five Thousand Two Hundred Thirty-One

Basics

Value: 25230 → 25231 → 25232

Parity: odd

Prime: No

Previous Prime: 25229

Next Prime: 25237

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 23 × 1097

Divisors: 1, 23, 1097, 25231

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001010001111

Octal: 61217

Duodecimal: 12727

Hexadecimal: 628f

Square: 636603361

Square Root: 158.8426894760977

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 of permutations satisfying i-4<=p(i)<=i+4, i=1..n (permutations of length n within distance 4). A72856

a(n) = G_n(5), where G_n(k) is the Goodstein function defined in A266201. A266204

Let X_m,n(q) be the chromatic polynomial of the complete bipartite graph K_m,n. Then a(n) is the negative of the coefficient of the linear term of X_n,n(q). A92552

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,k+n} having excedance set {1,2,...,k} (the empty set for k=0), 0 <= k <= n-1. A136126

a(n) = n³ + n² + 1. A98547

Numbers k such that the coefficient of x^k in the expansion of ∏_j>=1 (1 - x^j)⁵ is zero. A302057

Last number of height n in Recamán's sequence A005132. A64293

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime. A251950

Triangle T(n,k), n>=0, 0<=k<=2n, read by rows: row n gives the coefficients of the chromatic polynomial of the complete bipartite graph K_n,n, highest powers first. A212084

a(n) = 30·n² + 1. A158558