Base | Representation |
---|---|
bin | 110000000001100000110110… |
… | …001001000110000111011111 |
3 | 1000200211111111101111101211122 |
4 | 300001200312021012013133 |
5 | 210140432012321231421 |
6 | 2025112345143241155 |
7 | 62326302102060206 |
oct | 6001406611060737 |
9 | 1020744441441748 |
10 | 211210220102111 |
11 | 6133082a01043a |
12 | 1b831b574491bb |
13 | 90b10661945a9 |
14 | 3a228b473623d |
15 | 19640e10562ab |
hex | c018362461df |
211210220102111 has 2 divisors, whose sum is σ = 211210220102112. Its totient is φ = 211210220102110.
The previous prime is 211210220102107. The next prime is 211210220102113. The reversal of 211210220102111 is 111201022012112.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 211210220102111 - 22 = 211210220102107 is a prime.
Together with 211210220102113, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 211210220102111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211210220102113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105605110051055 + 105605110051056.
It is an arithmetic number, because the mean of its divisors is an integer number (105605110051056).
Almost surely, 2211210220102111 is an apocalyptic number.
211210220102111 is a deficient number, since it is larger than the sum of its proper divisors (1).
211210220102111 is an equidigital number, since it uses as much as digits as its factorization.
211210220102111 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 211210220102111 its reverse (111201022012112), we get a palindrome (322411242114223).
The spelling of 211210220102111 in words is "two hundred eleven trillion, two hundred ten billion, two hundred twenty million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •