Properties of the Number -30125

Thirty Thousand One Hundred Twenty-Five

Basics

Value: -30126 → -30125 → -30124

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 5 ³ × 241

Divisors: 1, 5, 25, 125, 241, 1205, 6025, 30125

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111010110101101

Octal: -72655

Duodecimal: -15525

Hexadecimal: -75ad

Square: 907515625

Square Root: 173.5655495770978

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

a(n) = ceiling(∑_i=1..n-1 a(i)/4) for n >= 2 starting with a(1) = 1. A120160

a(n) = a(n-1)+a(n-4). A14097

G.f.: ∑_k>=0 x^k * ∏_j=1..6·k (1 + x^j)/(1 - x^j). A385092

Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of continued fraction 1/(1 - k·x/(1 - k·x²/(1 - k·x³/(1 - k·x⁴/(1 - k·x⁵/(1 - ...)))))). A286933

Look at the first 10 digits of the sequence: they are all different. The same for the next 10. And the next 10, etc. This sequence is the slowest increasing one with that property. A97912

a(n) = A113166(n) - Fibonacci(n-1), where Fibonacci(n) = A000045(n). A113486