Base | Representation |
---|---|
bin | 10010101110000111… |
… | …100111001001001111 |
3 | 1220212212202200112022 |
4 | 102232013213021033 |
5 | 312131340200421 |
6 | 13122340200355 |
7 | 1311060350261 |
oct | 225607471117 |
9 | 56785680468 |
10 | 20101100111 |
11 | 8585602034 |
12 | 3a8b9990bb |
13 | 1b846150a1 |
14 | d898c1b31 |
15 | 7c9a8b7ab |
hex | 4ae1e724f |
20101100111 has 2 divisors, whose sum is σ = 20101100112. Its totient is φ = 20101100110.
The previous prime is 20101100099. The next prime is 20101100113. The reversal of 20101100111 is 11100110102.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20101100111 - 214 = 20101083727 is a prime.
It is a Sophie Germain prime.
Together with 20101100113, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20101100113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050550055 + 10050550056.
It is an arithmetic number, because the mean of its divisors is an integer number (10050550056).
Almost surely, 220101100111 is an apocalyptic number.
20101100111 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101100111 is an equidigital number, since it uses as much as digits as its factorization.
20101100111 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 8.
Adding to 20101100111 its reverse (11100110102), we get a palindrome (31201210213).
Subtracting from 20101100111 its reverse (11100110102), we obtain a palindrome (9000990009).
The spelling of 20101100111 in words is "twenty billion, one hundred one million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •