Base | Representation |
---|---|
bin | 110011110010010110… |
… | …001100000111001111 |
3 | 12022112020120121120211 |
4 | 303302112030013033 |
5 | 1402340002314412 |
6 | 41313403023251 |
7 | 4005646020163 |
oct | 636226140717 |
9 | 168466517524 |
10 | 55605510607 |
11 | 21644952149 |
12 | a93a20ab27 |
13 | 53221a64ca |
14 | 2996db0ca3 |
15 | 16a6a56ca7 |
hex | cf258c1cf |
55605510607 has 2 divisors, whose sum is σ = 55605510608. Its totient is φ = 55605510606.
The previous prime is 55605510577. The next prime is 55605510661. The reversal of 55605510607 is 70601550655.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 55605510607 - 27 = 55605510479 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 55605510607.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55605510007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27802755303 + 27802755304.
It is an arithmetic number, because the mean of its divisors is an integer number (27802755304).
Almost surely, 255605510607 is an apocalyptic number.
55605510607 is a deficient number, since it is larger than the sum of its proper divisors (1).
55605510607 is an equidigital number, since it uses as much as digits as its factorization.
55605510607 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 157500, while the sum is 40.
The spelling of 55605510607 in words is "fifty-five billion, six hundred five million, five hundred ten thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •