Properties of the Number -31092

Thirty-One Thousand Ninety-Two

Basics

Value: -31093 → -31092 → -31091

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 2591

Divisors: 1, 2, 3, 4, 6, 12, 2591, 5182, 7773, 10364

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -111100101110100

Octal: -74564

Duodecimal: -15BB0

Hexadecimal: -7974

Square: 966712464

Square Root: 176.3292375075671

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

T(n,k)=Number of length n+4 0..k arrays with some disjoint pairs in every consecutive five terms having the same sum. A247927

Number of closed λ-terms of size n with size 1 for the variables. A135501

Number of distinct factorizations of 105·2ⁿ. A93802

Expansion of ((1-x)/(1-2·x))⁶. A169793

a(n) is the smallest k such that prime(k), prime(k+1), ..., prime(k+n-1) all have 10 as a primitive root, but prime(k-1) and prime(k+n) do not. A60262

Expansion of (1-x)/(1-x-2·x²-2·x³). A78006

a(n) = [ a(n-1)/a(1) + a(n-3)/a(3) + a(n-5)/a(5) + ... ], for n >= 3. A22871

Number of 6-step one space at a time bishop's tours on an n X n board summed over all starting positions. A187159

Number of length n+4 0..3 arrays with some disjoint pairs in every consecutive five terms having the same sum. A247922

Number of length 4+4 0..n arrays with some disjoint pairs in every consecutive five terms having the same sum. A247931