Base | Representation |
---|---|
bin | 1100010010101… |
… | …01010111100001 |
3 | 21012000112111002 |
4 | 12021111113201 |
5 | 202344010423 |
6 | 14122001345 |
7 | 2361264401 |
oct | 611252741 |
9 | 235015432 |
10 | 103110113 |
11 | 53226177 |
12 | 2a646255 |
13 | 18492302 |
14 | d9a0801 |
15 | 90bb228 |
hex | 62555e1 |
103110113 has 2 divisors, whose sum is σ = 103110114. Its totient is φ = 103110112.
The previous prime is 103110043. The next prime is 103110179. The reversal of 103110113 is 311011301.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 64272289 + 38837824 = 8017^2 + 6232^2 .
It is a cyclic number.
It is not a de Polignac number, because 103110113 - 210 = 103109089 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 103110094 and 103110103.
It is not a weakly prime, because it can be changed into another prime (103115113) 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, 51555056 + 51555057.
It is an arithmetic number, because the mean of its divisors is an integer number (51555057).
Almost surely, 2103110113 is an apocalyptic number.
It is an amenable number.
103110113 is a deficient number, since it is larger than the sum of its proper divisors (1).
103110113 is an equidigital number, since it uses as much as digits as its factorization.
103110113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 11.
The square root of 103110113 is about 10154.3149941293. The cubic root of 103110113 is about 468.9217973425.
Adding to 103110113 its reverse (311011301), we get a palindrome (414121414).
The spelling of 103110113 in words is "one hundred three million, one hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •