Properties of the Number 25124

Twenty-Five Thousand One Hundred Twenty-Four

Basics

Value: 25123 → 25124 → 25125

Parity: even

Prime: No

Previous Prime: 25121

Next Prime: 25127

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 11 × 571

Divisors: 1, 2, 4, 11, 22, 44, 571, 1142, 2284, 6281

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110001000100100

Octal: 61044

Duodecimal: 12658

Hexadecimal: 6224

Square: 631215376

Square Root: 158.50552040859648

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

Numbers n such that Bernoulli number B_n has denominator 690. A272186

Number A(n,k) of multisets of nonempty words with a total of n letters over k-ary alphabet; square array A(n,k), n>=0, k>=0, read by antidiagonals. A144074

Triangle read by rows: T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = 3·x + 2. A257610

a(n) = A000011(n) - A256216(n). A256217

Euler transform of powers of 4. A144068

n(k) is the minimum n that requires at least k to make 2·Prime[n]+Prime[k] a prime. A114234

Index of 2ⁿ in A351495. A361334

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A001950 (upper Wythoff sequence), t = A014306. A25124