Properties of the Number -2031

Thirty-One

Basics

Value: -2032 → -2031 → -2030

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 6

Digital Root: 6

Palindrome: No

Factorization: 3 × 677

Divisors: 1, 3, 677, 2031

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11111101111

Octal: -3757

Duodecimal: -1213

Hexadecimal: -7ef

Square: 4124961

Square Root: 45.066617356974994

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 exp( ∑_n>=1 -sigma₂(3·n)*xⁿ/n ) in powers of x. A283243

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

Expansion of 1 / ((1-x)*(1-x+x²+x³)). A77872

Centered pentagonal numbers: (5n²+5n+2)/2; crystal ball sequence for 3.3.3.4.4. planar net. A5891

a(n) = ∑_k=0..n T(k) where T(n) are the tribonacci numbers A000073. A8937

V-toothpick (or honeycomb) sequence (see Comments lines for definition). A161206

Number of partitions of n with designated summands. A77285

Triangle G(n,k) read by rows, for 0 <= k <= n, where G(n, 0) = G(n+1, n+1) = 1, G(n+2, n+1) = 2, G(n+3, n+1) = 4, and G(n+4, m) = G(n+1, m-1) + G(n+1, m) + G(n+2, m) + G(n+3, m) for n >= 0 and m = 1..n+1. A140997

Number of compositions of n with runs-resistance 2. A329745

a(n) = n² + 6. A114949