Properties of the Number -5687

Six Hundred Eighty-Seven

Basics

Value: -5688 → -5687 → -5686

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 11 ² × 47

Divisors: 1, 11, 47, 121, 517, 5687

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1011000110111

Octal: -13067

Duodecimal: -335B

Hexadecimal: -1637

Square: 32341969

Square Root: 75.41220060441148

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

G.f.: ∏_i>=1 (1 - 2*(-x)ⁱ)/(1 - (-x)ⁱ)². A104510

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 297", based on the 5-celled von Neumann neighborhood. A271151

Number of non-Look-and-Say partitions of n. Number of integer partitions of n such that there is no way to choose a disjoint strict integer partition of each multiplicity. A351293

Numbers k such that the centered cube number k³ + (k+1)³ is equal to at least one other sum of two cubes. A352134

Numbers k such that the centered cube number k³ + (k+1)³ is equal to at least two other sums of two cubes. A352221

a(n) = |1³ - 2³ + 3³ - 4³ + ... + (-1)ⁿ⁺¹*n³|. A11934

Alternating sum of cubes, i.e., ∑_k=0..n k^p*q^k for p=3, q=-1. A232599

Number of integer partitions of n where no part is 2^k times any other part, for any k > 0. A323093

Number of integer partitions of n such that it is not possible to choose a different constant integer partition of each part. A387329

Total number of smallest parts that are also emergent parts in all partitions of n. A220479