Base | Representation |
---|---|
bin | 110000001110011111100101… |
… | …011111000101100100011111 |
3 | 1000210222202220101212210010222 |
4 | 300032133211133011210133 |
5 | 210300040321322010421 |
6 | 2031034225331151555 |
7 | 62450610512043002 |
oct | 6016374537054437 |
9 | 1023882811783128 |
10 | 212102220110111 |
11 | 616450568388a1 |
12 | 1b9569b84455bb |
13 | 91471cc411106 |
14 | 3a53b33457539 |
15 | 197c3eb089cab |
hex | c0e7e57c591f |
212102220110111 has 2 divisors, whose sum is σ = 212102220110112. Its totient is φ = 212102220110110.
The previous prime is 212102220110023. The next prime is 212102220110113. The reversal of 212102220110111 is 111011022201212.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212102220110111 - 238 = 211827342203167 is a prime.
Together with 212102220110113, 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 212102220110111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212102220110113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106051110055055 + 106051110055056.
It is an arithmetic number, because the mean of its divisors is an integer number (106051110055056).
Almost surely, 2212102220110111 is an apocalyptic number.
212102220110111 is a deficient number, since it is larger than the sum of its proper divisors (1).
212102220110111 is an equidigital number, since it uses as much as digits as its factorization.
212102220110111 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 17.
Adding to 212102220110111 its reverse (111011022201212), we get a palindrome (323113242311323).
The spelling of 212102220110111 in words is "two hundred twelve trillion, one hundred two billion, two hundred twenty million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •