Properties of the Number -56960

Fifty-Six Thousand Nine Hundred Sixty

Basics

Value: -56961 → -56960 → -56959

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 ⁷ × 5 × 89

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1101111010000000

Octal: -157200

Duodecimal: -28B68

Hexadecimal: -de80

Square: 3244441600

Square Root: 238.66294224282078

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

T(n,k)=Number of length n+4 0..k arrays with some disjoint pairs in every consecutive five terms having the same sum. A247927

T(n,k) = Rolling icosahedron footprints: number of n X k 0..11 arrays starting with 0 where 0..11 label vertices of an icosahedron and every array movement to a horizontal, vertical or antidiagonal neighbor moves along an icosahedral edge. A223186

a(n) = ∑_j=0..n (-1)^j*binomial(2·n - j, j)*c(n - j + 1)², where c(n) is the n-th Catalan number. A358118

Antidiagonal sums of array A089900. A89902

Icosagonal numbers divisible by 20. A117798

Column 5 of A060244. A291590

Rolling icosahedron footprints: number of n X 3 0..11 arrays starting with 0 where 0..11 label vertices of an icosahedron and every array movement to a horizontal, vertical or antidiagonal neighbor moves along an icosahedral edge. A223181

Rolling icosahedron footprints: number of nX6 0..11 arrays starting with 0 where 0..11 label vertices of an icosahedron and every array movement to a horizontal, vertical or antidiagonal neighbor moves along an icosahedral edge. A223184

Number of length 1+4 0..n arrays with some disjoint pairs in every consecutive five terms having the same sum. A247928

Triangle read by rows: T(n,k) is the number of pairs (c,m), where c is a covering of the 1 X (2n) grid with 1 X 2 rectangles and equal numbers of red and blue 1 X 1 squares and m is a matching between red squares and blue squares, such that exactly k matched pairs are adjacent. A360441