Properties of the Number 99125

Ninety-Nine Thousand One Hundred Twenty-Five

Basics

Value: 99124 → 99125 → 99126

Parity: odd

Prime: No

Previous Prime: 99119

Next Prime: 99131

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 5 ³ × 13 × 61

Divisors: 1, 5, 13, 25, 61, 65, 125, 305, 325, 793

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11000001100110101

Octal: 301465

Duodecimal: 49445

Hexadecimal: 18335

Square: 9825765625

Square Root: 314.8412298286233

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 that are the hypotenuse of exactly 31 distinct integer-sided right triangles, i.e., n² can be written as a sum of two squares in 31 ways. A97244

Numbers that are the sum of 2 nonzero squares in 7 or more ways. A25298

Numbers that are the sum of 2 nonzero squares in 8 or more ways. A25299

Numbers that are the sum of 2 distinct nonzero squares in 7 or more ways. A25317

Numbers that are the sum of 2 distinct nonzero squares in 8 or more ways. A25318

Numbers that are the sum of 2 nonzero squares in exactly 8 ways. A25291

Numbers that are the sum of 2 distinct nonzero squares in exactly 8 ways. A25309

a(0) = 1; for n>1, a(n) is the numerator of b(n) = ∏_i=1..n (prime(i)² + 1)/(prime(i)² - 1). A285602

Number of (n+2) X (4+2) 0..1 arrays with no 3·3 subblock diagonal sum less than the antidiagonal sum or central row sum less than the central column sum. A258890

a(n) = ∑_{k = 0..n} C(n,k) * C(n+k,k) * C(n+2·k,k) * C(n+3·k,k). A82488