Base | Representation |
---|---|
bin | 1010000000010010010100… |
… | …0000011100110011010100 |
3 | 1102221121000011002112200210 |
4 | 2200010211000130303110 |
5 | 2420211031210320040 |
6 | 35221202304005420 |
7 | 2213504023201566 |
oct | 240044500346324 |
9 | 42847004075623 |
10 | 11000032120020 |
11 | 35610a63a8189 |
12 | 1297a68600870 |
13 | 61a3b5c8bc98 |
14 | 2a0593937336 |
15 | 141209401480 |
hex | a012501ccd4 |
11000032120020 has 48 divisors (see below), whose sum is σ = 30800485150848. Its totient is φ = 2933304259200.
The previous prime is 11000032120003. The next prime is 11000032120039. The reversal of 11000032120020 is 2002123000011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 11000032119978 and 11000032120005.
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, 3706177 + ... + 5977943.
It is an arithmetic number, because the mean of its divisors is an integer number (641676773976).
Almost surely, 211000032120020 is an apocalyptic number.
11000032120020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11000032120020 is an abundant number, since it is smaller than the sum of its proper divisors (19800453030828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000032120020 is a wasteful number, since it uses less digits than its factorization.
11000032120020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2352480 (or 2352478 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 11000032120020 its reverse (2002123000011), we get a palindrome (13002155120031).
The spelling of 11000032120020 in words is "eleven trillion, thirty-two million, one hundred twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •