Properties of the Number 25004

Twenty-Five Thousand Four

Basics

Value: 25003 → 25004 → 25005

Parity: even

Prime: No

Previous Prime: 24989

Next Prime: 25013

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 7 × 19 × 47

Divisors: 1, 2, 4, 7, 14, 19, 28, 38, 47, 76

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110000110101100

Octal: 60654

Duodecimal: 12578

Hexadecimal: 61ac

Square: 625200016

Square Root: 158.12653161313568

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

Let f(k) = exp(π*sqrt(k)); sequence gives numbers k such that ceiling(f(k)) - f(k) < 1/10³. A127022

Expansion of q * ψ(q²) * ψ(-q⁹) / (φ(-q³) * ψ(-q³)) in powers of q where φ(), ψ() are Ramanujan θ functions. A139214

Expansion of q * (ψ(-q³) * ψ(q⁶)) / (ψ(-q) * φ(-q)) in powers of q where φ(), ψ() are Ramanujan θ functions. A187100

Expansion of q * (ψ(q³) * ψ(q⁶)) / (ψ(q) * φ(q)) in powers of q where φ(), ψ() are Ramanujan θ functions. A228447

Smallest j such that j·2*p(n)³-1=q is prime, j·2*p(n)*q²-1=r, j·2*p(n)*r²-1=s, where r and s are also prime. A224611

a(n) = ∑_i=0..n ∑_j=0..n (i XOR j), where XOR is the binary logical exclusive-or operator. A224923

Number of n-step walks (each step +-1 starting from 0) which are never more than 5 or less than -5. A216241

Primitive sliding numbers (excludes multiples of 10): totals, including repetitions, of sums r + s, r >= s, such that 1/r + 1/s = (r + s)/10^k for some k >= 0. A103184

Values of y in x² - 289 = 2·y². A106528

Number of 3-rowed binary matrices with n ones and no zero columns, up to row and column permutation. A58053