Properties of the Number 25859

Twenty-Five Thousand Eight Hundred Fifty-Nine

Basics

Value: 25858 → 25859 → 25860

Parity: odd

Prime: No

Previous Prime: 25849

Next Prime: 25867

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 19 × 1361

Divisors: 1, 19, 1361, 25859

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010100000011

Octal: 62403

Duodecimal: 12B6B

Hexadecimal: 6503

Square: 668687881

Square Root: 160.80733814101893

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

Consecutive states of the linear congruential pseudo-random number generator (421·s + 17117) mod 81000 when started at s=1. A385338

a(0) = 1, a(n) = 17·n² + 2 for n>0. A10007

Number of 5X2 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2·n² (number of collections of 5 zero-sum 2-vectors with total modulus squared not more than 2·n², ignoring vector and component permutations). A192705

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

Number of (n+1)X(5+1) 0..2 arrays with nondecreasing max(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250589

Number of (5+1)X(n+1) 0..2 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250637

Expansion of 1/((1-x⁴)*(1-x⁵)*(1-x⁷)). A25859