ℕ atory
Play Now

Properties of the Number -31011

Thirty-One Thousand Eleven

Basics

Value: -31012 → -31011 → -31010

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 6

Digital Root: 6

Palindrome: No

Factorization: 3 × 10337

Divisors: 1, 3, 10337, 31011

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111100100100011

Octal: -74443

Duodecimal: -15B43

Hexadecimal: -7923

Square: 961682121

Square Root: 176.0994037468611

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 seven fourth powers in exactly seven ways. A345829
T(n,k)=Number of nXk 0..2 arrays with every element plus 1 mod 3 equal to some element at offset (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero. A277945
Antidiagonal sums of the array defined in A385623. A385624
A nonlinear recurrence. A3073
Counting integers normally (1, 2, 3, 4, 5...), write them as roman numerals (I, II, III, IV, V...), describe them (one 1, two 1s, three 1s, one 1 one 5, one 5...), and write them out as numbers (11, 21, 31, 1115, 15...). A180105
Number of nX3 0..2 arrays with every element plus 1 mod 3 equal to some element at offset (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero. A277940
Number of nX5 0..2 arrays with every element plus 1 mod 3 equal to some element at offset (-1,0) (-1,1) (0,-1) (0,1) or (1,0), with upper left element zero. A277942
Number of partitions satisfying cn(2,5) + cn(3,5) < cn(1,5) + cn(4,5). A39893
Triangle T(n,k) read by rows, defined by the equation f(x, y) := ∑n, k T(n, k) * yk * xn = 1/(1 - x·y - x2*y·f(x, y+1)). A357438