Properties of the Number -55756

Fifty-Five Thousand Seven Hundred Fifty-Six

Basics

Value: -55757 → -55756 → -55755

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 53 × 263

Divisors: 1, 2, 4, 53, 106, 212, 263, 526, 1052, 13939

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1101100111001100

Octal: -154714

Duodecimal: -28324

Hexadecimal: -d9cc

Square: 3108731536

Square Root: 236.12708442700935

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

Array read by antidiagonals: number of ways of dividing an n X m rectangle into integer-sided rectangles. A116694

Number of ways to cut a 2 X n rectangle into rectangles with integer sides. A34999

Number of ways to cut an 8 X n rectangle into rectangles with integer sides. A220301

Array read by antidiagonals: Place k points in general position on each side of a regular n-gon and join every pair of the k·n boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of regions in the resulting planar graph. A392228

Difference between the numbers of trees on n vertices with an even number and an odd number of leaves. A262395

a(n) = (n² - n + 2) * (5·n² - 5·n + 2) / 4. A380353

Number of (n+2)X(6+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 and no antidiagonal sum 0 and no row sum 2 and no column sum 2. A255226

Least k such that at least half of the last n digits of 2^k are 9. A280660

T(2n,n), T given by A026692. A26693

T(n,[ n/2 ]), T given by A026692. A26698