Properties of the Number -31314

Thirty-One Thousand Three Hundred Fourteen

Basics

Value: -31315 → -31314 → -31313

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 17 × 307

Divisors: 1, 2, 3, 6, 17, 34, 51, 102, 307, 614

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -111101001010010

Octal: -75122

Duodecimal: -16156

Hexadecimal: -7a52

Square: 980566596

Square Root: 176.95762204550556

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 3 nonzero 6th powers. A3359

Expansion of (1/x) * Series_Reversion( x * (1-x-x³)² ). A368962

a(n) = Sum of all divisors of all numbers < (n+1)². A168013

a(n) = 27·n² - 51·n + 24, n>=1. A304836

a(n) = (2·n⁴ - 6*(-1)ⁿ*n² - 2·n² + 3*(-1)ⁿ - 3)/96. A350050

Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 2 X n array. A219803

a(n) is the number of n-subsets of [0..p-1] whose n*(n-1) differences are congruent to 1..p-1 (mod p), where p=n*(n-1)+1. A351690

a(n) is the σ irregularity of the n-th power of a path graph of length at least 3·n. A363706