Base | Representation |
---|---|
bin | 100001000101010… |
… | …1101100000110101 |
3 | 2212100212010120022 |
4 | 1002022231200311 |
5 | 4233141312432 |
6 | 302053214525 |
7 | 36336505103 |
oct | 10212554065 |
9 | 2770763508 |
10 | 1110104117 |
11 | 51a696721 |
12 | 26b931445 |
13 | 148caaa55 |
14 | a760cc73 |
15 | 676ceb12 |
hex | 422ad835 |
1110104117 has 2 divisors, whose sum is σ = 1110104118. Its totient is φ = 1110104116.
The previous prime is 1110104113. The next prime is 1110104123. The reversal of 1110104117 is 7114010111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 795183601 + 314920516 = 28199^2 + 17746^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110104117 - 22 = 1110104113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1110104095 and 1110104104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110104111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555052058 + 555052059.
It is an arithmetic number, because the mean of its divisors is an integer number (555052059).
Almost surely, 21110104117 is an apocalyptic number.
It is an amenable number.
1110104117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110104117 is an equidigital number, since it uses as much as digits as its factorization.
1110104117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 17.
The square root of 1110104117 is about 33318.2249977396. The cubic root of 1110104117 is about 1035.4311775947.
Adding to 1110104117 its reverse (7114010111), we get a palindrome (8224114228).
The spelling of 1110104117 in words is "one billion, one hundred ten million, one hundred four thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •