Base | Representation |
---|---|
bin | 11001000011111010011001… |
… | …001101100010001111001111 |
3 | 112110020221010210021102101222 |
4 | 121003322121031202033033 |
5 | 103421321100412241421 |
6 | 1030230213445553555 |
7 | 32134063606125416 |
oct | 3103723115421717 |
9 | 473227123242358 |
10 | 110220021212111 |
11 | 321350595a9388 |
12 | 104414661158bb |
13 | 496691b4b42b5 |
14 | 1d3096b06a47d |
15 | cb21206e2cab |
hex | 643e993623cf |
110220021212111 has 2 divisors, whose sum is σ = 110220021212112. Its totient is φ = 110220021212110.
The previous prime is 110220021212087. The next prime is 110220021212117. The reversal of 110220021212111 is 111212120022011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110220021212111 - 210 = 110220021211087 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110220021212111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110220021212117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55110010606055 + 55110010606056.
It is an arithmetic number, because the mean of its divisors is an integer number (55110010606056).
Almost surely, 2110220021212111 is an apocalyptic number.
110220021212111 is a deficient number, since it is larger than the sum of its proper divisors (1).
110220021212111 is an equidigital number, since it uses as much as digits as its factorization.
110220021212111 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 110220021212111 its reverse (111212120022011), we get a palindrome (221432141234122).
The spelling of 110220021212111 in words is "one hundred ten trillion, two hundred twenty billion, twenty-one million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •