Properties of the Number -5680

Six Hundred Eighty

Basics

Value: -5681 → -5680 → -5679

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ⁴ × 5 × 71

Divisors: 1, 2, 4, 5, 8, 10, 16, 20, 40, 71

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1011000110000

Octal: -13060

Duodecimal: -3354

Hexadecimal: -1630

Square: 32262400

Square Root: 75.3657747256671

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

A triangular sequence of three back recursive polynomial that are Hermite H(x,n) like and alternating orthogonal on domain {-Infinity,Infinity} and weight function Exp[ -x²/2]: P(x, n) = 2·x*P(x, n - 1) - n·P(x, n - 2) + 4·x³*P(x, n - 3). A138090

A triangular sequence of four back recursive polynomial that are Hermite H(x,n) like and alternating orthogonal on domain {-Infinity,Infinity} and weight function Exp[ -x²/2]: P(x, n) = 2·x*P(x, n - 1) - n·P(x, n - 2) + 4·x³*P(x, n - 3)-n²*P(x, n - 4). A138092

Let f(x) = 1 + x² + x⁴ + x⁵ + x⁶ + x¹⁰ + x¹¹; sequence has g.f. g(x) = 1/(x¹¹*f(1/x)). A157876

a(n) = n*(11·n + 3)/2. A254963

T(n,k)=Number of nXk array permutations with each element not moving, or moving one space N, SW or SE. A189435

Numbers k such that k!!!! + 1 is prime. A85146

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock having a single 1 or two 1s on the same edge. A251258

T(n,k)=1/5 the number of nXk 0..4 arrays with every element equal to exactly one or two of its horizontal and vertical neighbors. A185825

T(n,k) = number of n X k 0..2 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other. A201277

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no element having a strict majority of its horizontal and vertical neighbors equal to one. A231977