Base | Representation |
---|---|
bin | 11001010000111001001101… |
… | …01000010000010011010100 |
3 | 21021201002212122120012012020 |
4 | 30220130212220100103110 |
5 | 24240212242303414000 |
6 | 314054032544253140 |
7 | 14462535465623013 |
oct | 1450344650202324 |
9 | 237632778505166 |
10 | 55556050060500 |
11 | 1677a208a090a0 |
12 | 62931749111b0 |
13 | 24ccbb3c4a582 |
14 | da0cda224a7a |
15 | 665218a7eba0 |
hex | 328726a104d4 |
55556050060500 has 384 divisors, whose sum is σ = 181307175469056. Its totient is φ = 13100453568000.
The previous prime is 55556050060409. The next prime is 55556050060571. The reversal of 55556050060500 is 506005065555.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2614760877 + ... + 2614782123.
It is an arithmetic number, because the mean of its divisors is an integer number (472154102784).
Almost surely, 255556050060500 is an apocalyptic number.
55556050060500 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 55556050060500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90653587734528).
55556050060500 is an abundant number, since it is smaller than the sum of its proper divisors (125751125408556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55556050060500 is a wasteful number, since it uses less digits than its factorization.
55556050060500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25600 (or 25588 counting only the distinct ones).
The product of its (nonzero) digits is 562500, while the sum is 42.
The spelling of 55556050060500 in words is "fifty-five trillion, five hundred fifty-six billion, fifty million, sixty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •