Properties of the Number -15126

Fifteen Thousand One Hundred Twenty-Six

Basics

Value: -15127 → -15126 → -15125

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 2521

Divisors: 1, 2, 3, 6, 2521, 5042, 7563, 15126

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11101100010110

Octal: -35426

Duodecimal: -8906

Hexadecimal: -3b16

Square: 228795876

Square Root: 122.98780427343192

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

G.f.: ∏_n>=1 (1 - Lucas(n)*xⁿ + (-1)ⁿ*x^2·n) where Lucas(n) = A000204(n). A203860

G.f. A(x) satisfies: A(x) = x + x² / exp(A(x) + A(x²)/2 + A(x³)/3 + A(x⁴)/4 + ...). A345232

a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 2. A1610

a(n) = floor(φⁿ), where φ = (1+sqrt(5))/2 is the golden ratio. A14217

a(n) = floor(n*φ²⁰), where φ is the golden ratio, A001622. A4935

Number of polyforms with n cells on the faces of a deltoidal hexecontahedron up to rotation. A383498

Numbers that have 10 terms in their Zeckendorf representation. A179250

a(n) = Fibonacci(n-1) + Fibonacci(n+1) - (-1)ⁿ. A98600

Number of cyclic binary n-bit strings with no alternating substring of length > 2. A7039

a(n) = L(3·n)/L(n), where L(n) = Lucas number. A110391