Base | Representation |
---|---|
bin | 110011110010101001… |
… | …010011000000010000 |
3 | 12022112121000002120220 |
4 | 303302221103000100 |
5 | 1402342243111233 |
6 | 41314102233040 |
7 | 4006036421442 |
oct | 636251230020 |
9 | 168477002526 |
10 | 55610519568 |
11 | 2164776348a |
12 | a93ba25780 |
13 | 532323b3a6 |
14 | 2997916492 |
15 | 16a71e5eb3 |
hex | cf2a53010 |
55610519568 has 160 divisors (see below), whose sum is σ = 151807426560. Its totient is φ = 17515799040.
The previous prime is 55610519539. The next prime is 55610519603. The reversal of 55610519568 is 86591501655.
It is a happy number.
It is a hoax number, since the sum of its digits (51) coincides with the sum of the digits of its distinct prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 55610519568.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 45247978 + ... + 45249206.
It is an arithmetic number, because the mean of its divisors is an integer number (948796416).
Almost surely, 255610519568 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 55610519568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75903713280).
55610519568 is an abundant number, since it is smaller than the sum of its proper divisors (96196906992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55610519568 is a wasteful number, since it uses less digits than its factorization.
55610519568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1965 (or 1959 counting only the distinct ones).
The product of its (nonzero) digits is 1620000, while the sum is 51.
The spelling of 55610519568 in words is "fifty-five billion, six hundred ten million, five hundred nineteen thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •