Properties of the Number 25835

Twenty-Five Thousand Eight Hundred Thirty-Five

Basics

Value: 25834 → 25835 → 25836

Parity: odd

Prime: No

Previous Prime: 25819

Next Prime: 25841

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 5 × 5167

Divisors: 1, 5, 5167, 25835

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010011101011

Octal: 62353

Duodecimal: 12B4B

Hexadecimal: 64eb

Square: 667447225

Square Root: 160.73269735806713

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 vertices in a graph of n adjacent rectangles in a row with all possible diagonals drawn, as in A306302, but without the rectangles' edges which are perpendicular to the row. A369176

Triangle read by rows: T(n,k) is the number of k-matchings in the P₄ X P_n lattice graph. A100265

Triangle of coefficients of polynomials p_n(x) (exponents in increasing order) where 2^x-n-1p_n(x)/n! counts the ways a game of Nim with two piles of sizes·and n can be played out (x > 0, n >= 0). A289329

G.f.: P(x,y) = ∏_n>=1 1/(1 - (xⁿ + yⁿ)), where P(x,y) = ∑_n>=0 ∑_k>=0 T(n,k) * xⁿ*y^k, as a square table of coefficients T(n,k) read by antidiagonals. A322210

Number of matchings in graph P₅ X P_n. A33508

Number of nX4 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 2,0,1,0,0 for x=0,1,2,3,4. A197533

Expansion of 1/((1-x³)*(1-x⁵)*(1-x⁶)). A25835