Base | Representation |
---|---|
bin | 110011110000101011… |
… | …111101101000000000 |
3 | 12022110022011212020000 |
4 | 303300223331220000 |
5 | 1402310340222000 |
6 | 41310530120000 |
7 | 4005160230555 |
oct | 636053755000 |
9 | 168408155200 |
10 | 55577664000 |
11 | 21630162621 |
12 | a930a20000 |
13 | 53194a6721 |
14 | 2993402a2c |
15 | 16a43a6000 |
hex | cf0afda00 |
55577664000 has 800 divisors, whose sum is σ = 211330259712. Its totient is φ = 14515200000.
The previous prime is 55577663941. The next prime is 55577664041. The reversal of 55577664000 is 46677555.
It is a tau number, because it is divible by the number of its divisors (800).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 368063925 + ... + 368064075.
Almost surely, 255577664000 is an apocalyptic number.
55577664000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 55577664000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (105665129856).
55577664000 is an abundant number, since it is smaller than the sum of its proper divisors (155752595712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55577664000 is an equidigital number, since it uses as much as digits as its factorization.
55577664000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267 (or 232 counting only the distinct ones).
The product of its (nonzero) digits is 882000, while the sum is 45.
The spelling of 55577664000 in words is "fifty-five billion, five hundred seventy-seven million, six hundred sixty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •