Properties of the Number -31944

Thirty-One Thousand Nine Hundred Forty-Four

Basics

Value: -31945 → -31944 → -31943

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 11 ³

Divisors: 1, 2, 3, 4, 6, 8, 11, 12, 22, 24

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -111110011001000

Octal: -76310

Duodecimal: -165A0

Hexadecimal: -7cc8

Square: 1020419136

Square Root: 178.72884490199112

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

a(n) = 3·n³. A117642

T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A234998

Total area of the shadows of the three views of the shell model of partitions, version "Tree", with n shells. A210980

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays colored with the maximum plus the upper median minus the minimum of every 2X2 subblock. A236588

Number of paraffins. A6009

Numbers k such that φ(τ(k)) = sopf(k). A173326

Number of (w,x,y) with all terms in {0,...,n} and 2·max(w,x,y) > 3·min(w,x,y). A213393

Number of 5-cycles in the n-triangular honeycomb obtuse knight graph. A290391

Expansion of φ(x²) * χ(x)⁴ in powers of·where φ(), χ() are Ramanujan θ functions. A260515

Expansion of e.g.f. (1 + 2·log(1 - x))^3/2. A375987