Base | Representation |
---|---|
bin | 110011010001100010… |
… | …0110001100010110101 |
3 | 101112012202121122202221 |
4 | 1212203010301202311 |
5 | 3301001142320432 |
6 | 122330042002341 |
7 | 10645426402234 |
oct | 1464304614265 |
9 | 345182548687 |
10 | 110110120117 |
11 | 42774323a78 |
12 | 1940b7a63b1 |
13 | a4ca274b3a |
14 | 5487a8ab1b |
15 | 2ce6aeab97 |
hex | 19a31318b5 |
110110120117 has 2 divisors, whose sum is σ = 110110120118. Its totient is φ = 110110120116.
The previous prime is 110110120103. The next prime is 110110120123. The reversal of 110110120117 is 711021011011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65827651761 + 44282468356 = 256569^2 + 210434^2 .
It is a cyclic number.
It is not a de Polignac number, because 110110120117 - 27 = 110110119989 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110110120117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110110120517) 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, 55055060058 + 55055060059.
It is an arithmetic number, because the mean of its divisors is an integer number (55055060059).
Almost surely, 2110110120117 is an apocalyptic number.
It is an amenable number.
110110120117 is a deficient number, since it is larger than the sum of its proper divisors (1).
110110120117 is an equidigital number, since it uses as much as digits as its factorization.
110110120117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14, while the sum is 16.
Adding to 110110120117 its reverse (711021011011), we get a palindrome (821131131128).
The spelling of 110110120117 in words is "one hundred ten billion, one hundred ten million, one hundred twenty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •