Base | Representation |
---|---|
bin | 10000001001111101001… |
… | …001001011110011011011 |
3 | 10221010121211021110101111 |
4 | 100021331021023303123 |
5 | 121142142441401021 |
6 | 2210004103001151 |
7 | 143131550556022 |
oct | 20117511136333 |
9 | 3833554243344 |
10 | 1110201122011 |
11 | 398919654a43 |
12 | 15b1b81391b7 |
13 | 808cb353647 |
14 | 3ba3c2218b9 |
15 | 1dd2b33a8e1 |
hex | 1027d24bcdb |
1110201122011 has 2 divisors, whose sum is σ = 1110201122012. Its totient is φ = 1110201122010.
The previous prime is 1110201121957. The next prime is 1110201122021. The reversal of 1110201122011 is 1102211020111.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1110201122011 - 215 = 1110201089243 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1110201121982 and 1110201122000.
It is not a weakly prime, because it can be changed into another prime (1110201122021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555100561005 + 555100561006.
It is an arithmetic number, because the mean of its divisors is an integer number (555100561006).
Almost surely, 21110201122011 is an apocalyptic number.
1110201122011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110201122011 is an equidigital number, since it uses as much as digits as its factorization.
1110201122011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1110201122011 its reverse (1102211020111), we get a palindrome (2212412142122).
The spelling of 1110201122011 in words is "one trillion, one hundred ten billion, two hundred one million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •