Base | Representation |
---|---|
bin | 11110100100110011111… |
… | …010111111011110011111 |
3 | 21102212022222100122000002 |
4 | 132210303322333132133 |
5 | 233411033142010421 |
6 | 4245123041324515 |
7 | 304541316155135 |
oct | 36446372773637 |
9 | 7385288318002 |
10 | 2101110110111 |
11 | 740091977061 |
12 | 29b26163673b |
13 | 1231980544ac |
14 | 739a1121755 |
15 | 399c48e8b0b |
hex | 1e933ebf79f |
2101110110111 has 2 divisors, whose sum is σ = 2101110110112. Its totient is φ = 2101110110110.
The previous prime is 2101110110107. The next prime is 2101110110117. The reversal of 2101110110111 is 1110110111012.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2101110110111 - 22 = 2101110110107 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2101110110092 and 2101110110101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2101110110117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050555055055 + 1050555055056.
It is an arithmetic number, because the mean of its divisors is an integer number (1050555055056).
Almost surely, 22101110110111 is an apocalyptic number.
2101110110111 is a deficient number, since it is larger than the sum of its proper divisors (1).
2101110110111 is an equidigital number, since it uses as much as digits as its factorization.
2101110110111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 2101110110111 its reverse (1110110111012), we get a palindrome (3211220221123).
Subtracting from 2101110110111 its reverse (1110110111012), we obtain a palindrome (990999999099).
The spelling of 2101110110111 in words is "two trillion, one hundred one billion, one hundred ten million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •