Properties of the Number 8925

Eight Thousand Nine Hundred Twenty-Five

Basics

Value: 8924 → 8925 → 8926

Parity: odd

Prime: No

Previous Prime: 8923

Next Prime: 8929

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 ² × 7 × 17

Divisors: 1, 3, 5, 7, 15, 17, 21, 25, 35, 51

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10001011011101

Octal: 21335

Duodecimal: 51B9

Hexadecimal: 22dd

Square: 79655625

Square Root: 94.47221813845591

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

Odd abundant numbers (odd numbers m whose sum of divisors exceeds 2m). A5231

Odd primitive abundant numbers. A6038

Numbers k such that σ(k) - 2k = 6. A87167

Number of different lattice paths running from (0,0) to (n,0) using steps from S = {(k,k) or (k,-k): k positive integer} that never go below the x-axis. A59231

Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one component such that for each point (p₁,p₂,...,p_k) we have p₁<=p₂<=...<=p_k; square array A(n,k), n>=0, k>=0, read by antidiagonals. A227578

Odd numbers m whose abundance by absolute value is at most 10, that is, -10 <= σ(m) - 2m <= 10. A77374

Array of q-factorial numbers n!_q, read by ascending antidiagonals. A69777

Odd solutions to abs(σ(k) - 2k) <= log(k). Numbers k whose abundance-radius does not exceed log(k). A88012

Numbers k such that σ(k) == 0 (mod k+3). A274551

Even and odd solutions to abs(σ(x)-2x) <= log(x). Numbers n whose abundance-radius does not exceed log(n). A88011