Base | Representation |
---|---|
bin | 10010101110110001… |
… | …100111011000000101 |
3 | 1220220122111002210001 |
4 | 102232301213120011 |
5 | 312142200023414 |
6 | 13123412201301 |
7 | 1311253060306 |
oct | 225661473005 |
9 | 56818432701 |
10 | 20112111109 |
11 | 8590842832 |
12 | 3a93609231 |
13 | 1b8699bb7c |
14 | d8b14a7ad |
15 | 7caa14074 |
hex | 4aec67605 |
20112111109 has 2 divisors, whose sum is σ = 20112111110. Its totient is φ = 20112111108.
The previous prime is 20112110989. The next prime is 20112111157. The reversal of 20112111109 is 90111121102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16905720484 + 3206390625 = 130022^2 + 56625^2 .
It is a cyclic number.
It is not a de Polignac number, because 20112111109 - 29 = 20112110597 is a prime.
It is a super-2 number, since 2×201121111092 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20112111199) 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, 10056055554 + 10056055555.
It is an arithmetic number, because the mean of its divisors is an integer number (10056055555).
Almost surely, 220112111109 is an apocalyptic number.
It is an amenable number.
20112111109 is a deficient number, since it is larger than the sum of its proper divisors (1).
20112111109 is an equidigital number, since it uses as much as digits as its factorization.
20112111109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 19.
The spelling of 20112111109 in words is "twenty billion, one hundred twelve million, one hundred eleven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •