Properties of the Number -16947

Sixteen Thousand Nine Hundred Forty-Seven

Basics

Value: -16948 → -16947 → -16946

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 7 × 269

Divisors: 1, 3, 7, 9, 21, 63, 269, 807, 1883, 2421

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100001000110011

Octal: -41063

Duodecimal: -9983

Hexadecimal: -4233

Square: 287200809

Square Root: 130.18064372248278

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 that are the sum of eight fourth powers in eight or more ways. A345583

Numbers that are the sum of eight fourth powers in exactly eight ways. A345840

Triangle read by rows: T(n, k) = C(n, k)*C(2·k, k)/(k+1) - sum(j = 0..k, (-1)^j*(1-j)ⁿ*C(k, j)/k!), 0<=k<=n. A247493

a(n) = Sum{k=0..n} (-1)^n-k*binomial(n, k)*Stirling2(n, k). A343841

Shifts left twice under "AGK" (ordered, elements, unlabeled) transform. A32029

L-th order palindromes with L > 2. A89381

a(1)=1; a(n+1) = ∑_{k=0..a(n) mod n} a(n-k). A130618

General partition graphs on n vertices. A7269

A triangle sequence of polynomial coefficients:p(x,n)=Sum[Binomial[n, k]*(-x)^k*Sum[StirlingS2[n, m]*x^m, {m, 0, n - k}], {k, 0, n}]. A174859