Base | Representation |
---|---|
bin | 10100100101111011… |
… | …00001000001001000 |
3 | 1001112110221022202212 |
4 | 22102331201001020 |
5 | 140120204043102 |
6 | 5025010244252 |
7 | 540652326665 |
oct | 122275410110 |
9 | 31473838685 |
10 | 11055534152 |
11 | 4763619493 |
12 | 2186586688 |
13 | 107259c9b0 |
14 | 76c408a6c |
15 | 44a8adc52 |
hex | 292f61048 |
11055534152 has 64 divisors (see below), whose sum is σ = 22861440000. Its totient is φ = 4980628224.
The previous prime is 11055534109. The next prime is 11055534167. The reversal of 11055534152 is 25143555011.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1091849 + ... + 1101927.
It is an arithmetic number, because the mean of its divisors is an integer number (357210000).
Almost surely, 211055534152 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 11055534152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11430720000).
11055534152 is an abundant number, since it is smaller than the sum of its proper divisors (11805905848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11055534152 is a wasteful number, since it uses less digits than its factorization.
11055534152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10350 (or 10346 counting only the distinct ones).
The product of its (nonzero) digits is 15000, while the sum is 32.
The spelling of 11055534152 in words is "eleven billion, fifty-five million, five hundred thirty-four thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •