Base | Representation |
---|---|
bin | 110000000000001110101100… |
… | …100001111001011011100101 |
3 | 1000200112001211000101122021122 |
4 | 300000032230201321123211 |
5 | 210133010340033031041 |
6 | 2025004040253423325 |
7 | 62320030161433511 |
oct | 6000165441713345 |
9 | 1020461730348248 |
10 | 211122012002021 |
11 | 612a738492126a |
12 | 1b818a3a79ab45 |
13 | 90a5949687523 |
14 | 3a1c507803141 |
15 | 1961b7c182c4b |
hex | c003ac8796e5 |
211122012002021 has 2 divisors, whose sum is σ = 211122012002022. Its totient is φ = 211122012002020.
The previous prime is 211122012001997. The next prime is 211122012002063. The reversal of 211122012002021 is 120200210221112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 198583054802500 + 12538957199521 = 14091950^2 + 3541039^2 .
It is a cyclic number.
It is not a de Polignac number, because 211122012002021 - 210 = 211122012000997 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211122012002071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105561006001010 + 105561006001011.
It is an arithmetic number, because the mean of its divisors is an integer number (105561006001011).
Almost surely, 2211122012002021 is an apocalyptic number.
It is an amenable number.
211122012002021 is a deficient number, since it is larger than the sum of its proper divisors (1).
211122012002021 is an equidigital number, since it uses as much as digits as its factorization.
211122012002021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 211122012002021 its reverse (120200210221112), we get a palindrome (331322222223133).
The spelling of 211122012002021 in words is "two hundred eleven trillion, one hundred twenty-two billion, twelve million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •