Properties of the Number 25090

Twenty-Five Thousand Ninety

Basics

Value: 25089 → 25090 → 25091

Parity: even

Prime: No

Previous Prime: 25087

Next Prime: 25097

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 13 × 193

Divisors: 1, 2, 5, 10, 13, 26, 65, 130, 193, 386

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001000000010

Octal: 61002

Duodecimal: 1262A

Hexadecimal: 6202

Square: 629508100

Square Root: 158.39823231336896

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 partitions of n having no more odd than even parts. A171966

a(n) = n! * [xⁿ] exp(x)/(1 - log(1+x)). A291981

a(0) = 1, a(n) = 32·n² + 2 for n > 0. A10021

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 6, n >= 2. A213070

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 7, n >= 2. A214373

Number of partitions of n into 8 parts such that every i-th smallest part (counted with multiplicity) is different from i. A244244

Positions of 0's in A330314. A330325

Coordination sequence for MgNi2, Position Ni3. A9934

Numbers k such that (φ(k-2) + φ(k+2))/2 = φ(k); 2-φ/balanced numbers. A99633

a(n) = number of terms in A213717 whose magnitude is in range [(2ⁿ)-1,(2ⁿ⁺¹)-2] (or equally, in range [(2ⁿ),(2ⁿ⁺¹)-1]). A213722