Properties of the Number -55553

Fifty-Five Thousand Five Hundred Fifty-Three

Basics

Value: -55554 → -55553 → -55552

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 73 × 761

Divisors: 1, 73, 761, 55553

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1101100100000001

Octal: -154401

Duodecimal: -28195

Hexadecimal: -d901

Square: 3086135809

Square Root: 235.69683918118207

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

Number A(n,k) of domicule tilings of a k X n grid; square array A(n,k), n>=0, k>=0, read by antidiagonals. A239264

Primes in carryless arithmetic mod 10 in which all digits except the rightmost are zero or five. A169984

A symmetrical triangle read by rows: T(n, k) = 2ⁿ*(q^k - 1)*(q^{n - k} - 1) + 1, where q = 2. A176793

Composite numbers k such that all the decimal concatenations ik and ikj (i, j = 1...9) are also composite. A32737

Numbers having four 5's in base 10. A43512

a(n) = (5·10ⁿ - 23)/9. A173802

Total number of largest parts in all partitions of n that contain at least two distinct parts. A182629

For k in {2,3,...,9} define a sequence as follows: a(0)=0; for n>=0, a(n+1)=a(n)+1, unless a(n) ends in k, in which case a(n+1) is obtained by replacing the last digit of a(n) with the digit(s) of k². This is k(7). A237344

Number of domicule tilings of a 4 X n grid. A239266

Number of domicule tilings of a 7 X 2n grid. A239269