Base | Representation |
---|---|
bin | 11101010001000100111… |
… | …111001110110100110011 |
3 | 21010021021010121120002212 |
4 | 131101010333032310303 |
5 | 230422420220333021 |
6 | 4135533345202335 |
7 | 265206314651006 |
oct | 35210477166463 |
9 | 7107233546085 |
10 | 2011202121011 |
11 | 705a45190136 |
12 | 28594b6303ab |
13 | 11786a309545 |
14 | 6d4b253553d |
15 | 374b169485b |
hex | 1d444fced33 |
2011202121011 has 2 divisors, whose sum is σ = 2011202121012. Its totient is φ = 2011202121010.
The previous prime is 2011202120999. The next prime is 2011202121013. The reversal of 2011202121011 is 1101212021102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2011202121011 - 218 = 2011201858867 is a prime.
It is a Sophie Germain prime.
Together with 2011202121013, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2011202121013) 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, 1005601060505 + 1005601060506.
It is an arithmetic number, because the mean of its divisors is an integer number (1005601060506).
Almost surely, 22011202121011 is an apocalyptic number.
2011202121011 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011202121011 is an equidigital number, since it uses as much as digits as its factorization.
2011202121011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2011202121011 its reverse (1101212021102), we get a palindrome (3112414142113).
Subtracting from 2011202121011 its reverse (1101212021102), we obtain a palindrome (909990099909).
The spelling of 2011202121011 in words is "two trillion, eleven billion, two hundred two million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •