Base | Representation |
---|---|
bin | 11110101101010001110… |
… | …010011010001001000111 |
3 | 21110201210112200022220211 |
4 | 132231101302122021013 |
5 | 234033142441023421 |
6 | 4253225113140251 |
7 | 305312515331212 |
oct | 36552162321107 |
9 | 7421715608824 |
10 | 2110201111111 |
11 | 743a27572725 |
12 | 2a0b7a0ba687 |
13 | 123cb6617222 |
14 | 741c4664779 |
15 | 39d57a9d9e1 |
hex | 1eb51c9a247 |
2110201111111 has 2 divisors, whose sum is σ = 2110201111112. Its totient is φ = 2110201111110.
The previous prime is 2110201111097. The next prime is 2110201111171. The reversal of 2110201111111 is 1111111020112.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2110201111111 - 25 = 2110201111079 is a prime.
2110201111111 is a modest number, since divided by 1111111 gives 211020 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 2110201111091 and 2110201111100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2110201111171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055100555555 + 1055100555556.
It is an arithmetic number, because the mean of its divisors is an integer number (1055100555556).
Almost surely, 22110201111111 is an apocalyptic number.
2110201111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
2110201111111 is an equidigital number, since it uses as much as digits as its factorization.
2110201111111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 2110201111111 its reverse (1111111020112), we get a palindrome (3221312131223).
Subtracting from 2110201111111 its reverse (1111111020112), we obtain a palindrome (999090090999).
The spelling of 2110201111111 in words is "two trillion, one hundred ten billion, two hundred one million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •