Base | Representation |
---|---|
bin | 110000000001011001001100… |
… | …110010100000011101111111 |
3 | 1000200210201022012222012112022 |
4 | 300001121030302200131333 |
5 | 210140313204042401421 |
6 | 2025104510343030355 |
7 | 62325561461305361 |
oct | 6001311462403577 |
9 | 1020721265865468 |
10 | 211202010122111 |
11 | 613282a67639a8 |
12 | 1b830445a3b3bb |
13 | 90b03582b1768 |
14 | 3a2233620cd31 |
15 | 1963cb03ce7ab |
hex | c0164cca077f |
211202010122111 has 2 divisors, whose sum is σ = 211202010122112. Its totient is φ = 211202010122110.
The previous prime is 211202010122101. The next prime is 211202010122149. The reversal of 211202010122111 is 111221010202112.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 211202010122111 - 210 = 211202010121087 is a prime.
It is a super-2 number, since 2×2112020101221112 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 211202010122111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211202010122101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105601005061055 + 105601005061056.
It is an arithmetic number, because the mean of its divisors is an integer number (105601005061056).
Almost surely, 2211202010122111 is an apocalyptic number.
211202010122111 is a deficient number, since it is larger than the sum of its proper divisors (1).
211202010122111 is an equidigital number, since it uses as much as digits as its factorization.
211202010122111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 211202010122111 its reverse (111221010202112), we get a palindrome (322423020324223).
The spelling of 211202010122111 in words is "two hundred eleven trillion, two hundred two billion, ten million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •