Properties of the Number -5312

Three Hundred Twelve

Basics

Value: -5313 → -5312 → -5311

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ⁶ × 83

Divisors: 1, 2, 4, 8, 16, 32, 64, 83, 166, 332

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1010011000000

Octal: -12300

Duodecimal: -30A8

Hexadecimal: -14c0

Square: 28217344

Square Root: 72.8834686331544

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

Normalized sequence of cumulants formed from moments in a quantum many-body problem at its critical point. A11859

Expansion of e.g.f. 1 / (1 - x·log(1 - x)). A375684

Numbers k such that the Woodall number k·2^k - 1 is prime. A2234

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A023531, t = (Fibonacci numbers). A24318

Consider the base-9 Kaprekar map n->K(n) defined in A165110. Sequence gives numbers belonging to cycles, including fixed points. A165115

Numbers whose divisors can be partitioned in exactly one way into two disjoint sets with the same sum. A83209

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A023531, t = (F(2), F(3), ...). A24322

G.f.: ∏_k>=1 (1+x^k)^2·k-1. A255835

Numbers with prime factorization p·q⁶. A189987

Consider the base-9 Kaprekar map n->K(n) defined in A165110. Sequence gives numbers belonging to cycles of length greater than 1. A165117