Base | Representation |
---|---|
bin | 1010000111011001001100… |
… | …1101000110010110111011 |
3 | 1110101021012001122021011001 |
4 | 2201312103031012112323 |
5 | 2424211120320422021 |
6 | 35353235055545431 |
7 | 2225355666156535 |
oct | 241662315062673 |
9 | 43337161567131 |
10 | 11122140014011 |
11 | 35a89670a2254 |
12 | 12b766622b277 |
13 | 628a75a992b0 |
14 | 2a6458bc2855 |
15 | 1444a447d091 |
hex | a1d933465bb |
11122140014011 has 16 divisors (see below), whose sum is σ = 12498603473664. Its totient is φ = 9820103239584.
The previous prime is 11122140014003. The next prime is 11122140014023. The reversal of 11122140014011 is 11041004122111.
It is a cyclic number.
It is not a de Polignac number, because 11122140014011 - 23 = 11122140014003 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11122140014011.
It is not an unprimeable number, because it can be changed into a prime (11122140014071) 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 15 ways as a sum of consecutive naturals, for example, 35360740 + ... + 35673886.
It is an arithmetic number, because the mean of its divisors is an integer number (781162717104).
Almost surely, 211122140014011 is an apocalyptic number.
11122140014011 is a deficient number, since it is larger than the sum of its proper divisors (1376463459653).
11122140014011 is a wasteful number, since it uses less digits than its factorization.
11122140014011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 431970.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 11122140014011 its reverse (11041004122111), we get a palindrome (22163144136122).
The spelling of 11122140014011 in words is "eleven trillion, one hundred twenty-two billion, one hundred forty million, fourteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •