Base | Representation |
---|---|
bin | 11001000011111010011111… |
… | …001110011101111110101111 |
3 | 112110020221101211011002011022 |
4 | 121003322133032131332233 |
5 | 103421321302230320421 |
6 | 1030230231452444355 |
7 | 32134066242622013 |
oct | 3103723716357657 |
9 | 473227354132138 |
10 | 110220122120111 |
11 | 32135100560023 |
12 | 10441493a796bb |
13 | 4966936385183 |
14 | 1d3097a616543 |
15 | cb21294c67ab |
hex | 643e9f39dfaf |
110220122120111 has 2 divisors, whose sum is σ = 110220122120112. Its totient is φ = 110220122120110.
The previous prime is 110220122120077. The next prime is 110220122120149. The reversal of 110220122120111 is 111021221022011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110220122120111 - 26 = 110220122120047 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110220122120111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110220122120161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55110061060055 + 55110061060056.
It is an arithmetic number, because the mean of its divisors is an integer number (55110061060056).
Almost surely, 2110220122120111 is an apocalyptic number.
110220122120111 is a deficient number, since it is larger than the sum of its proper divisors (1).
110220122120111 is an equidigital number, since it uses as much as digits as its factorization.
110220122120111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 110220122120111 its reverse (111021221022011), we get a palindrome (221241343142122).
The spelling of 110220122120111 in words is "one hundred ten trillion, two hundred twenty billion, one hundred twenty-two million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •