ℕ atory
Play Now

Properties of the Number -28658

Twenty-Eight Thousand Six Hundred Fifty-Eight

Basics

Value: -28659 → -28658 → -28657

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 × 7 × 23 × 89

Divisors: 1, 2, 7, 14, 23, 46, 89, 161, 178, 322

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110111111110010

Octal: -67762

Duodecimal: -14702

Hexadecimal: -6ff2

Square: 821280964

Square Root: 169.28673899629587

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

First differences of A116697. A186679
a(n) = Fibonacci(n) + 1. A1611
Fully additive with a(p) = Fibonacci(p); If, for p prime, pmn,p is the highest power of p dividing n with m>=0, then a(n) = ∑p prime F(p)*(mn,p), where F(p) = p-th Fibonacci number. A113177
Inverse Moebius transform of Fibonacci numbers 1,1,2,3,5,8,... A7435
One of four 3rd-order recurring sequences for which the first derived sequence and the Galois transformed sequence coincide. A32908
a(n) is the sum of the divisors of Fibonacci(n) (A000045). A63477
a(n) = F(n)*L(n+1) where F=Fibonacci and L=Lucas numbers. A81714
Pisot sequences L(4,6), E(4,6). A20706
a(n) = a(n-1) + a(n-3) + a(n-4), n >= 4, with initial terms 0,1,3,3. A111573
Strictly increasing list of F and F + 1, where F = A000045, the Fibonacci numbers. A259623