Properties of the Number -31914

Thirty-One Thousand Nine Hundred Fourteen

Basics

Value: -31915 → -31914 → -31913

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ⁴ × 197

Divisors: 1, 2, 3, 6, 9, 18, 27, 54, 81, 162

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111110010101010

Octal: -76252

Duodecimal: -16576

Hexadecimal: -7caa

Square: 1018503396

Square Root: 178.64489917151286

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

Expansion of 1 / (1 + ∑_k>=1 μ(k)² * x^k). A329099

Expansion of 1/(1 - x*∏_k>=1 1/(1 + k·x^k)). A299210

Numbers k such that the powerful part of the sum of divisors of k (A387726) is greater than or equal to k, and σ(k) is not itself a powerful number. A387729

If n mod 2 = 0 then a(n) = n⁴/4 - 2·n² + 3·n; otherwise, a(n) = n⁴/4 - 2·n² + 3·n - 5/4. A64835

a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero icosahedral numbers in exactly n ways, or -1 if no such integer exists. A360215

Number of total cyclic orders Z on {1, ..., n+2} such that (i, i+1, i+2) in Z for 1 <= i <= n, and (n+1,n+2,1) in Z. A295263

Primitive practical numbers of the form 2·3ⁱ * prime(k). A367481