Base | Representation |
---|---|
bin | 110011110010010110… |
… | …001010110000100000 |
3 | 12022112020120022222020 |
4 | 303302112022300200 |
5 | 1402340002130211 |
6 | 41313402541440 |
7 | 4005645665043 |
oct | 636226126040 |
9 | 168466508866 |
10 | 55605505056 |
11 | 21644948a62 |
12 | a93a207880 |
13 | 53221a3b1a |
14 | 2996dacc5a |
15 | 16a6a55306 |
hex | cf258ac20 |
55605505056 has 96 divisors (see below), whose sum is σ = 150170448960. Its totient is φ = 18002820096.
The previous prime is 55605505001. The next prime is 55605505057. The reversal of 55605505056 is 65050550655.
It is a tau number, because it is divible by the number of its divisors (96).
It is a junction number, because it is equal to n+sod(n) for n = 55605504999 and 55605505017.
It is not an unprimeable number, because it can be changed into a prime (55605505057) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2071690 + ... + 2098358.
It is an arithmetic number, because the mean of its divisors is an integer number (1564275510).
Almost surely, 255605505056 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 55605505056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75085224480).
55605505056 is an abundant number, since it is smaller than the sum of its proper divisors (94564943904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55605505056 is a wasteful number, since it uses less digits than its factorization.
55605505056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27306 (or 27298 counting only the distinct ones).
The product of its (nonzero) digits is 562500, while the sum is 42.
The spelling of 55605505056 in words is "fifty-five billion, six hundred five million, five hundred five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •