Base | Representation |
---|---|
bin | 10010101110101101… |
… | …011000011000010011 |
3 | 1220220120101201010212 |
4 | 102232231120120103 |
5 | 312141404013412 |
6 | 13123332314335 |
7 | 1311240455201 |
oct | 225655303023 |
9 | 56816351125 |
10 | 20111001107 |
11 | 859015487a |
12 | 3a931729ab |
13 | 1b866a0872 |
14 | d8ad3c071 |
15 | 7ca895222 |
hex | 4aeb58613 |
20111001107 has 2 divisors, whose sum is σ = 20111001108. Its totient is φ = 20111001106.
The previous prime is 20111001083. The next prime is 20111001109. The reversal of 20111001107 is 70110011102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20111001107 - 216 = 20110935571 is a prime.
Together with 20111001109, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 20111001091 and 20111001100.
It is not a weakly prime, because it can be changed into another prime (20111001109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055500553 + 10055500554.
It is an arithmetic number, because the mean of its divisors is an integer number (10055500554).
Almost surely, 220111001107 is an apocalyptic number.
20111001107 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111001107 is an equidigital number, since it uses as much as digits as its factorization.
20111001107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14, while the sum is 14.
Adding to 20111001107 its reverse (70110011102), we get a palindrome (90221012209).
The spelling of 20111001107 in words is "twenty billion, one hundred eleven million, one thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •