Base | Representation |
---|---|
bin | 1010000111010001001110… |
… | …1010011110101001001100 |
3 | 1110101001122221021002001220 |
4 | 2201310103222132221030 |
5 | 2424142230024411022 |
6 | 35352242501003340 |
7 | 2225251654263210 |
oct | 241642352365114 |
9 | 43331587232056 |
10 | 11120000232012 |
11 | 35a7a69262381 |
12 | 12b71696b3550 |
13 | 6287c468cbb9 |
14 | 2a62d493c940 |
15 | 1443cb6a885c |
hex | a1d13a9ea4c |
11120000232012 has 24 divisors (see below), whose sum is σ = 29653333952256. Its totient is φ = 3177142923408.
The previous prime is 11120000231941. The next prime is 11120000232017. The reversal of 11120000232012 is 21023200002111.
It is a junction number, because it is equal to n+sod(n) for n = 11120000231982 and 11120000232000.
It is not an unprimeable number, because it can be changed into a prime (11120000232017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 66190477488 + ... + 66190477655.
It is an arithmetic number, because the mean of its divisors is an integer number (1235555581344).
Almost surely, 211120000232012 is an apocalyptic number.
11120000232012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11120000232012 is an abundant number, since it is smaller than the sum of its proper divisors (18533333720244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120000232012 is a wasteful number, since it uses less digits than its factorization.
11120000232012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132380955157 (or 132380955155 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 11120000232012 its reverse (21023200002111), we get a palindrome (32143200234123).
The spelling of 11120000232012 in words is "eleven trillion, one hundred twenty billion, two hundred thirty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •