Base | Representation |
---|---|
bin | 110011010100111100… |
… | …011001101001110000 |
3 | 12021020212100101211002 |
4 | 303110330121221300 |
5 | 1400332211223211 |
6 | 41152421541132 |
7 | 3660506031110 |
oct | 632474315160 |
9 | 167225311732 |
10 | 55112211056 |
11 | 21411451971 |
12 | a820b747a8 |
13 | 5273c29196 |
14 | 294b681040 |
15 | 16785b403b |
hex | cd4f19a70 |
55112211056 has 80 divisors (see below), whose sum is σ = 130492451520. Its totient is φ = 22009958400.
The previous prime is 55112210999. The next prime is 55112211097. The reversal of 55112211056 is 65011221155.
55112211056 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 49010 + ... + 335598.
It is an arithmetic number, because the mean of its divisors is an integer number (1631155644).
Almost surely, 255112211056 is an apocalyptic number.
55112211056 is a gapful number since it is divisible by the number (56) 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 55112211056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65246225760).
55112211056 is an abundant number, since it is smaller than the sum of its proper divisors (75380240464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55112211056 is a wasteful number, since it uses less digits than its factorization.
55112211056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 286722 (or 286716 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 29.
The spelling of 55112211056 in words is "fifty-five billion, one hundred twelve million, two hundred eleven thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •