Base | Representation |
---|---|
bin | 1010000000010110101010… |
… | …1011011101000001010011 |
3 | 1102221201000121120212102002 |
4 | 2200011222223131001103 |
5 | 2420220424430133021 |
6 | 35221514301344215 |
7 | 2213545005533315 |
oct | 240055253350123 |
9 | 42851017525362 |
10 | 11001201021011 |
11 | 35616461a2863 |
12 | 1298133b6806b |
13 | 61a5411b5186 |
14 | 2a0664c8d7b5 |
15 | 141276d4750b |
hex | a016aadd053 |
11001201021011 has 2 divisors, whose sum is σ = 11001201021012. Its totient is φ = 11001201021010.
The previous prime is 11001201020989. The next prime is 11001201021029. The reversal of 11001201021011 is 11012010210011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11001201021011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11001201020983 and 11001201021001.
It is not a weakly prime, because it can be changed into another prime (11001201021071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500600510505 + 5500600510506.
It is an arithmetic number, because the mean of its divisors is an integer number (5500600510506).
Almost surely, 211001201021011 is an apocalyptic number.
11001201021011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001201021011 is an equidigital number, since it uses as much as digits as its factorization.
11001201021011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11001201021011 its reverse (11012010210011), we get a palindrome (22013211231022).
The spelling of 11001201021011 in words is "eleven trillion, one billion, two hundred one million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •