Base | Representation |
---|---|
bin | 110000000001011001011000… |
… | …001110011101111100111011 |
3 | 1000200210201210121000200011122 |
4 | 300001121120032131330323 |
5 | 210140314102203014321 |
6 | 2025104541355415455 |
7 | 62325566311250561 |
oct | 6001313016357473 |
9 | 1020721717020148 |
10 | 211202202001211 |
11 | 61328394aaa573 |
12 | 1b83049a15458b |
13 | 90b0388c845a5 |
14 | 3a223538b9a31 |
15 | 1963cc21828ab |
hex | c0165839df3b |
211202202001211 has 2 divisors, whose sum is σ = 211202202001212. Its totient is φ = 211202202001210.
The previous prime is 211202202001207. The next prime is 211202202001223. The reversal of 211202202001211 is 112100202202112.
211202202001211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 211202202001211 - 22 = 211202202001207 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 211202202001211.
It is not a weakly prime, because it can be changed into another prime (211202202001261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105601101000605 + 105601101000606.
It is an arithmetic number, because the mean of its divisors is an integer number (105601101000606).
Almost surely, 2211202202001211 is an apocalyptic number.
211202202001211 is a deficient number, since it is larger than the sum of its proper divisors (1).
211202202001211 is an equidigital number, since it uses as much as digits as its factorization.
211202202001211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 211202202001211 its reverse (112100202202112), we get a palindrome (323302404203323).
The spelling of 211202202001211 in words is "two hundred eleven trillion, two hundred two billion, two hundred two million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •