Properties of the Number -28980

Twenty-Eight Thousand Nine Hundred Eighty

Basics

Value: -28981 → -28980 → -28979

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 5 × 7 × 23

Divisors: 1, 2, 3, 4, 5, 6, 7, 9, 10, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -111000100110100

Octal: -70464

Duodecimal: -14930

Hexadecimal: -7134

Square: 839840400

Square Root: 170.23513150933329

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

T(n,k) = (-1)ⁿ*(binomial(2·k,k)/(k+1))*∑_j=0..n (-1)^j*binomial(k,j)*jⁿ. Triangle read by rows, T(n, k) for n >= 0 and 0 <= k <= n. A335748

Denominators of the greedy Egyptian partial sums for L(3, chi3), where L(s, chi3) is the Dirichlet L-function for the non-principal character modulo 3. A129665

Number of cyclic compositions (necklaces of positive integers) summing to n that have only one part or whose consecutive parts (including the last with first) are indivisible. A318729

Expansion of g.f. A(x) satisfying 4·x = ∑_n=-oo..+oo x^n*(3·n+1/2) * (A(x)^3·n - 1/A(x)^3·n+1). A361554

a(n) = ∑_k=0..n k^2·n * Stirling1(n,k). A351183

Numbers k such that A383543(k) > A383543(m) for all m < k. A383544

Triangle read by rows: T(n,k) is the number of noncrossing path sets on n nodes with k paths and isolated vertices allowed, 0 <= k <= n. A390909

a(n) = 1 + L(n) + F(2·n-1) with {L(n)}_{n>=0} the Lucas numbers (A000032) and F(2·n-1)_{n>=0} the bisected Fibonacci numbers (A001519). A5522

12 times hexagonal numbers: 12·n*(2·n-1). A143698

a(n) = 1000·n - 20. A157515