Base | Representation |
---|---|
bin | 11001010101010001011101… |
… | …10101010000001110000000 |
3 | 21022020111020120101100110121 |
4 | 30222220232311100032000 |
5 | 24300143413423303440 |
6 | 314251115040110024 |
7 | 14506443200250556 |
oct | 1452505665201600 |
9 | 238214216340417 |
10 | 55706511541120 |
11 | 16827aa9554490 |
12 | 62b8366005314 |
13 | 2511141cb618b |
14 | da82d0dc1bd6 |
15 | 6690c2e1934a |
hex | 32aa2ed50380 |
55706511541120 has 256 divisors, whose sum is σ = 147620436768000. Its totient is φ = 19933165486080.
The previous prime is 55706511541097. The next prime is 55706511541141. The reversal of 55706511541120 is 2114511560755.
It is a congruent number.
It is an unprimeable number.
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 in 31 ways as a sum of consecutive naturals, for example, 110325391 + ... + 110829169.
It is an arithmetic number, because the mean of its divisors is an integer number (576642331125).
Almost surely, 255706511541120 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 55706511541120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73810218384000).
55706511541120 is an abundant number, since it is smaller than the sum of its proper divisors (91913925226880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55706511541120 is a wasteful number, since it uses less digits than its factorization.
55706511541120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 504061 (or 504049 counting only the distinct ones).
The product of its (nonzero) digits is 210000, while the sum is 43.
The spelling of 55706511541120 in words is "fifty-five trillion, seven hundred six billion, five hundred eleven million, five hundred forty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •