Base | Representation |
---|---|
bin | 1100010010110010000… |
… | …0110100111000011101 |
3 | 202012010220102210210211 |
4 | 3010230200310320131 |
5 | 11430014222401341 |
6 | 241005105132421 |
7 | 21154511036653 |
oct | 3045440647035 |
9 | 665126383724 |
10 | 211200200221 |
11 | 8162a00941a |
12 | 34b2262a111 |
13 | 16bba870c9a |
14 | a3177c6dd3 |
15 | 57618ac181 |
hex | 312c834e1d |
211200200221 has 2 divisors, whose sum is σ = 211200200222. Its totient is φ = 211200200220.
The previous prime is 211200200219. The next prime is 211200200227. The reversal of 211200200221 is 122002002112.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 208174100121 + 3026100100 = 456261^2 + 55010^2 .
It is a cyclic number.
It is not a de Polignac number, because 211200200221 - 21 = 211200200219 is a prime.
Together with 211200200219, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211200200227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105600100110 + 105600100111.
It is an arithmetic number, because the mean of its divisors is an integer number (105600100111).
Almost surely, 2211200200221 is an apocalyptic number.
It is an amenable number.
211200200221 is a deficient number, since it is larger than the sum of its proper divisors (1).
211200200221 is an equidigital number, since it uses as much as digits as its factorization.
211200200221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 211200200221 its reverse (122002002112), we get a palindrome (333202202333).
The spelling of 211200200221 in words is "two hundred eleven billion, two hundred million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •