Base | Representation |
---|---|
bin | 110100010000011010… |
… | …1011001110110001111 |
3 | 101201122210202200110011 |
4 | 1220200311121312033 |
5 | 3314311311120421 |
6 | 123315252254051 |
7 | 11051626301203 |
oct | 1504065316617 |
9 | 351583680404 |
10 | 112220020111 |
11 | 43657304081 |
12 | 198ba311327 |
13 | a77541ab84 |
14 | 5607d92b03 |
15 | 2dbbe6b4e1 |
hex | 1a20d59d8f |
112220020111 has 2 divisors, whose sum is σ = 112220020112. Its totient is φ = 112220020110.
The previous prime is 112220020109. The next prime is 112220020139. The reversal of 112220020111 is 111020022211.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 112220020111 - 21 = 112220020109 is a prime.
Together with 112220020109, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 112220020091 and 112220020100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112220020711) 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, 56110010055 + 56110010056.
It is an arithmetic number, because the mean of its divisors is an integer number (56110010056).
Almost surely, 2112220020111 is an apocalyptic number.
112220020111 is a deficient number, since it is larger than the sum of its proper divisors (1).
112220020111 is an equidigital number, since it uses as much as digits as its factorization.
112220020111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 112220020111 its reverse (111020022211), we get a palindrome (223240042322).
The spelling of 112220020111 in words is "one hundred twelve billion, two hundred twenty million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •