Base | Representation |
---|---|
bin | 11110101110001001010… |
… | …00111100110010011111 |
3 | 10201220121012202120100121 |
4 | 33113010220330302133 |
5 | 114243244402302412 |
6 | 2124530443535411 |
7 | 136155624304036 |
oct | 17270450746237 |
9 | 3656535676317 |
10 | 1055566056607 |
11 | 37773257a727 |
12 | 1506aab2a567 |
13 | 78702239b8a |
14 | 391380a771d |
15 | 1c6ceac8107 |
hex | f5c4a3cc9f |
1055566056607 has 2 divisors, whose sum is σ = 1055566056608. Its totient is φ = 1055566056606.
The previous prime is 1055566056553. The next prime is 1055566056637. The reversal of 1055566056607 is 7066506655501.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1055566056607 is a prime.
It is a super-2 number, since 2×10555660566072 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1055566056637) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527783028303 + 527783028304.
It is an arithmetic number, because the mean of its divisors is an integer number (527783028304).
Almost surely, 21055566056607 is an apocalyptic number.
1055566056607 is a deficient number, since it is larger than the sum of its proper divisors (1).
1055566056607 is an equidigital number, since it uses as much as digits as its factorization.
1055566056607 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5670000, while the sum is 52.
The spelling of 1055566056607 in words is "one trillion, fifty-five billion, five hundred sixty-six million, fifty-six thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •