Base | Representation |
---|---|
bin | 11001000010011110011000… |
… | …001100111001111101011111 |
3 | 112102220111010011101221022122 |
4 | 121002132120030321331133 |
5 | 103413211224311201421 |
6 | 1030112553505333155 |
7 | 32123665326640664 |
oct | 3102363014717537 |
9 | 472814104357278 |
10 | 110121220022111 |
11 | 320a7168936a51 |
12 | 104262919371bb |
13 | 495a5041704ac |
14 | 1d29c77309a6b |
15 | cae78b85b2ab |
hex | 642798339f5f |
110121220022111 has 2 divisors, whose sum is σ = 110121220022112. Its totient is φ = 110121220022110.
The previous prime is 110121220022083. The next prime is 110121220022159. The reversal of 110121220022111 is 111220022121011.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110121220022111 is a prime.
It is a super-4 number, since 4×1101212200221114 (a number of 57 digits) contains 4444 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110121220022111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110121220042111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55060610011055 + 55060610011056.
It is an arithmetic number, because the mean of its divisors is an integer number (55060610011056).
Almost surely, 2110121220022111 is an apocalyptic number.
110121220022111 is a deficient number, since it is larger than the sum of its proper divisors (1).
110121220022111 is an equidigital number, since it uses as much as digits as its factorization.
110121220022111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 110121220022111 its reverse (111220022121011), we get a palindrome (221341242143122).
The spelling of 110121220022111 in words is "one hundred ten trillion, one hundred twenty-one billion, two hundred twenty million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •