Base | Representation |
---|---|
bin | 110011010100110100… |
… | …0000001000101011111 |
3 | 101112111102102020222011 |
4 | 1212221220001011133 |
5 | 3301212311201421 |
6 | 122345005332051 |
7 | 10651232505223 |
oct | 1465150010537 |
9 | 345442366864 |
10 | 110220022111 |
11 | 42820368a71 |
12 | 19440567027 |
13 | a516c746c4 |
14 | 54984d8783 |
15 | 2d015a94e1 |
hex | 19a9a0115f |
110220022111 has 2 divisors, whose sum is σ = 110220022112. Its totient is φ = 110220022110.
The previous prime is 110220022063. The next prime is 110220022123. The reversal of 110220022111 is 111220022011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110220022111 - 213 = 110220013919 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110220022091 and 110220022100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110220022411) 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, 55110011055 + 55110011056.
It is an arithmetic number, because the mean of its divisors is an integer number (55110011056).
Almost surely, 2110220022111 is an apocalyptic number.
110220022111 is a deficient number, since it is larger than the sum of its proper divisors (1).
110220022111 is an equidigital number, since it uses as much as digits as its factorization.
110220022111 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 110220022111 its reverse (111220022011), we get a palindrome (221440044122).
The spelling of 110220022111 in words is "one hundred ten billion, two hundred twenty million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •