Base | Representation |
---|---|
bin | 1101000111010… |
… | …10001011101101 |
3 | 21200000010212211 |
4 | 12203222023231 |
5 | 211130323432 |
6 | 14525530421 |
7 | 2504036056 |
oct | 643521355 |
9 | 250003784 |
10 | 110011117 |
11 | 57109a87 |
12 | 30a13a11 |
13 | 19a3a448 |
14 | 1087972d |
15 | 99d0d47 |
hex | 68ea2ed |
110011117 has 2 divisors, whose sum is σ = 110011118. Its totient is φ = 110011116.
The previous prime is 110011103. The next prime is 110011127. The reversal of 110011117 is 711110011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108868356 + 1142761 = 10434^2 + 1069^2 .
It is an emirp because it is prime and its reverse (711110011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110011117 - 223 = 101622509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110011097 and 110011106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110011127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005558 + 55005559.
It is an arithmetic number, because the mean of its divisors is an integer number (55005559).
Almost surely, 2110011117 is an apocalyptic number.
It is an amenable number.
110011117 is a deficient number, since it is larger than the sum of its proper divisors (1).
110011117 is an equidigital number, since it uses as much as digits as its factorization.
110011117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7, while the sum is 13.
The square root of 110011117 is about 10488.6184504919. The cubic root of 110011117 is about 479.1581264397.
Adding to 110011117 its reverse (711110011), we get a palindrome (821121128).
The spelling of 110011117 in words is "one hundred ten million, eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •