Base | Representation |
---|---|
bin | 1010000111010001001110… |
… | …1101110010110110011100 |
3 | 1110101001122222220020101111 |
4 | 2201310103231302312130 |
5 | 2424142230240214322 |
6 | 35352242531351404 |
7 | 2225251664543263 |
oct | 241642355626634 |
9 | 43331588806344 |
10 | 11120001101212 |
11 | 35a7a697a6423 |
12 | 12b7169a52564 |
13 | 6287c4905713 |
14 | 2a62d4ac75da |
15 | 1443cb7cb177 |
hex | a1d13b72d9c |
11120001101212 has 12 divisors (see below), whose sum is σ = 20604707922960. Its totient is φ = 5232941694656.
The previous prime is 11120001101201. The next prime is 11120001101213. The reversal of 11120001101212 is 21210110002111.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11120001101192 and 11120001101201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120001101213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 81764713912 + ... + 81764714047.
It is an arithmetic number, because the mean of its divisors is an integer number (1717058993580).
Almost surely, 211120001101212 is an apocalyptic number.
It is an amenable number.
11120001101212 is a deficient number, since it is larger than the sum of its proper divisors (9484706821748).
11120001101212 is a wasteful number, since it uses less digits than its factorization.
11120001101212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163529427980 (or 163529427978 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11120001101212 its reverse (21210110002111), we get a palindrome (32330111103323).
The spelling of 11120001101212 in words is "eleven trillion, one hundred twenty billion, one million, one hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •