Properties of the Number 25900

Twenty-Five Thousand Nine Hundred

Basics

Value: 25899 → 25900 → 25901

Parity: even

Prime: No

Previous Prime: 25889

Next Prime: 25903

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 5 ² × 7 × 37

Divisors: 1, 2, 4, 5, 7, 10, 14, 20, 25, 28

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110010100101100

Octal: 62454

Duodecimal: 12BA4

Hexadecimal: 652c

Square: 670810000

Square Root: 160.93476939431082

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 subsets of {1,2,...,n-8} without differences equal to 2, 4, 6 or 8. A224811

The Wiener index of the P₃ X P_n grid, where P_m is the path graph on m nodes. The Wiener index of a connected graph is the sum of distances between all unordered pairs of nodes in the graph. A180569

∏_{d∣n, A007431(d) > 0} prime(A007431(d)), where A007431 is the Möbius transform of Euler's totient function. A318838

Number of tilings of a 5 X 2n rectangle using 2n pentominoes of shapes N, Y. A248102

Nearest k to j such that k*(2^j-1)+1 is prime where j=A000043(n) and 2^j-1 = Mersenne-prime(n) = A000668(n). If there are two k values equidistant from j, each of which produces a prime, the larger of the two gets added to the sequence. A159585

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

Numbers k such that 265·2^k + 1 is prime. A53349

Expansion of 1/((1-x⁶)*(1-x⁷)*(1-x¹¹)). A25900

Let s(k) be the sum of the decimal digits of a number k. a(n) is the smallest k such that s(k)*(s(k)+n)=k, or 0 if no such k exists. A190216