Base | Representation |
---|---|
bin | 1010000111011000101110… |
… | …0101001011110100101010 |
3 | 1110101020212010222001222222 |
4 | 2201312023211023310222 |
5 | 2424210340100010442 |
6 | 35353214250314042 |
7 | 2225352554046104 |
oct | 241661345136452 |
9 | 43336763861888 |
10 | 11122012110122 |
11 | 35a8900982161 |
12 | 12b762b428922 |
13 | 628a55435914 |
14 | 2a6445c0a574 |
15 | 1444981158d2 |
hex | a1d8b94bd2a |
11122012110122 has 8 divisors (see below), whose sum is σ = 16794984730500. Its totient is φ = 5523683866624.
The previous prime is 11122012110089. The next prime is 11122012110127. The reversal of 11122012110122 is 22101121022111.
11122012110122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 10913502066481 + 208510043641 = 3303559^2 + 456629^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 11122012110122.
It is not an unprimeable number, because it can be changed into a prime (11122012110127) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18661093847 + ... + 18661094442.
Almost surely, 211122012110122 is an apocalyptic number.
11122012110122 is a deficient number, since it is larger than the sum of its proper divisors (5672972620378).
11122012110122 is a wasteful number, since it uses less digits than its factorization.
11122012110122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37322188440.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11122012110122 its reverse (22101121022111), we get a palindrome (33223133132233).
The spelling of 11122012110122 in words is "eleven trillion, one hundred twenty-two billion, twelve million, one hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •