Properties of the Number 25368

Twenty-Five Thousand Three Hundred Sixty-Eight

Basics

Value: 25367 → 25368 → 25369

Parity: even

Prime: No

Previous Prime: 25367

Next Prime: 25373

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 7 × 151

Divisors: 1, 2, 3, 4, 6, 7, 8, 12, 14, 21

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110001100011000

Octal: 61430

Duodecimal: 12820

Hexadecimal: 6318

Square: 643535424

Square Root: 159.27334993651638

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 n-stacks with strictly receding walls, or the number of Type A partitions of n in the sense of Auluck (1951). A1522

A097806²⁴ * A000594. A128380

Binary "cubes"; numbers whose binary representation consists of three consecutive identical blocks. A297405

Expansion of (1-x)/( (1+x)*(1-2·x)*(1-3·x)*(1-4·x)*(1-5·x)). A4058

Triangle read by rows: T(n,k)=A(n,k)*binomial(n+k-1,n), where A(n,k) are the Eulerian numbers (A008292). A38675

Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)² = (S_i S_j)³ = I. A162740

Numbers whose binary expansion consists of alternating runs of 1's and 0's where each run of 0's is exactly one longer than the preceding run of 1's, and the expansion ends with a 0-run. A387269

Number of -1..1 arrays x(0..n+2) of n+3 elements with zero sum and nonzero second and third differences. A200197

Number of length 4+3 0..n arrays with every four consecutive terms having the sum of some three elements equal to three times the fourth. A248541

Square array T(n, k) read by antidiagonals, n >= 0 and k >= 0: the lengths of runs in binary expansion of T(n, k) are obtained by adding those of n and of k (see Comments for precise definition). A322404