Properties of the Number 25473

Twenty-Five Thousand Four Hundred Seventy-Three

Basics

Value: 25472 → 25473 → 25474

Parity: odd

Prime: No

Previous Prime: 25471

Next Prime: 25523

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 1213

Divisors: 1, 3, 7, 21, 1213, 3639, 8491, 25473

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001110000001

Octal: 61601

Duodecimal: 128A9

Hexadecimal: 6381

Square: 648873729

Square Root: 159.6026315572522

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

Triangle T(n,k), n>=1, 0<=k<=n-1, read by rows: T(n,k)/(n-1)! is the coefficient of x^k in polynomial p_n for the n-th row sequence of A145153. A145142

Expansion of (ψ(x³) / ψ(x))² in powers of·where ψ() is a Ramanujan θ function. A217786

5th column of A145142. A145147

a(n) = Fibonacci(n) represented in bijective base-7 numeration. A282238

Number of peakless Motzkin paths of length n containing no subwords of type uh^ju or dh^jd (j>=1), where u=(1,1), h=(1,0), and d=(1,-1) (can be easily expressed using RNA secondary structure terminology). A190160

Triangular array: Number of partitions of the vertex set of a forest of two trees on n vertices into k nonempty independent sets. A227341

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 777", based on the 5-celled von Neumann neighborhood. A273532

a(n) is the least k such that A295520(k) = n. A295793

Molien series for complete weight enumerators of self-dual codes over GF(9). A92071

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (-1, 0, -1), (0, -1, -1), (1, 1, 1)}. A149500