Properties of the Number -31213

Thirty-One Thousand Two Hundred Thirteen

Basics

Value: -31214 → -31213 → -31212

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: Yes

Factorization: 7 ⁴ × 13

Divisors: 1, 7, 13, 49, 91, 343, 637, 2401, 4459, 31213

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -111100111101101

Octal: -74755

Duodecimal: -16091

Hexadecimal: -79ed

Square: 974251369

Square Root: 176.67201249773547

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

Triangle with columns built from certain power sequences. A67402

Numbers of the form (7ⁱ)*(13^j). A108056

Composite numbers k that divide 3^k - 2^k - 1, excluding powers of 2, 3 and 7. A127073

Smallest k such that circle centered at the origin and with radius sqrt(k) passes through exactly 6·n integer points in the hexagonal lattice (see A004016). A343771

Triangular array T(n,k) (n >= 1, 1 <= k <= n) read by rows, where T(n,k) = smallest number·such that Mod[σ[x],n]=k. A74625

Triangle read by rows in which row n lists n+1 terms, starting with n⁵ and ending with n⁶, such that the difference between successive terms is equal to n⁵ - n⁴. A163285

a(n) = ∏_{d∣n, d>1} prime(1+(d mod 6)). A320116

Numbers m > 1 such that every prime divisor p of m satisfies s_p(m) = p. A324458

Capped binary boundary codes for holeless strictly non-overlapping polyhexes (all orientations and rotations included). A258002

Capped binary boundary codes for fusenes (all orientations and rotations included). A258012