Search a number
-
+
1055566056553 is a prime number
BaseRepresentation
bin11110101110001001010…
…00111100110001101001
310201220121012202120021121
433113010220330301221
5114243244402302203
62124530443535241
7136155624303631
oct17270450746151
93656535676247
101055566056553
1137773257a688
121506aab2a521
1378702239b48
14391380a76c1
151c6ceac80bd
hexf5c4a3cc69

1055566056553 has 2 divisors, whose sum is σ = 1055566056554. Its totient is φ = 1055566056552.

The previous prime is 1055566056529. The next prime is 1055566056607. The reversal of 1055566056553 is 3556506655501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 555422901289 + 500143155264 = 745267^2 + 707208^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1055566056553 is a prime.

It is a super-2 number, since 2×10555660565532 (a number of 25 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 1055566056553.

It is not a weakly prime, because it can be changed into another prime (1055566066553) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527783028276 + 527783028277.

It is an arithmetic number, because the mean of its divisors is an integer number (527783028277).

Almost surely, 21055566056553 is an apocalyptic number.

It is an amenable number.

1055566056553 is a deficient number, since it is larger than the sum of its proper divisors (1).

1055566056553 is an equidigital number, since it uses as much as digits as its factorization.

1055566056553 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 10125000, while the sum is 52.

The spelling of 1055566056553 in words is "one trillion, fifty-five billion, five hundred sixty-six million, fifty-six thousand, five hundred fifty-three".