Base | Representation |
---|---|
bin | 1010000000010110010111… |
… | …1110110001110110110011 |
3 | 1102221200211010021101200211 |
4 | 2200011211332301312303 |
5 | 2420220244240413021 |
6 | 35221502404124551 |
7 | 2213543030553355 |
oct | 240054576616663 |
9 | 42850733241624 |
10 | 11001122201011 |
11 | 3561605758168 |
12 | 1298111696757 |
13 | 61a52aa78c17 |
14 | 2a06586130d5 |
15 | 14126ee783e1 |
hex | a0165fb1db3 |
11001122201011 has 2 divisors, whose sum is σ = 11001122201012. Its totient is φ = 11001122201010.
The previous prime is 11001122201009. The next prime is 11001122201081. The reversal of 11001122201011 is 11010222110011.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11001122201011 - 21 = 11001122201009 is a prime.
Together with 11001122201009, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 11001122200982 and 11001122201000.
It is not a weakly prime, because it can be changed into another prime (11001122201081) 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 as a sum of consecutive naturals, namely, 5500561100505 + 5500561100506.
It is an arithmetic number, because the mean of its divisors is an integer number (5500561100506).
Almost surely, 211001122201011 is an apocalyptic number.
11001122201011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001122201011 is an equidigital number, since it uses as much as digits as its factorization.
11001122201011 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 11001122201011 its reverse (11010222110011), we get a palindrome (22011344311022).
The spelling of 11001122201011 in words is "eleven trillion, one billion, one hundred twenty-two million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •