Base | Representation |
---|---|
bin | 1101000111011… |
… | …10110100100001 |
3 | 21200001002221101 |
4 | 12203232310201 |
5 | 211131430423 |
6 | 14530154401 |
7 | 2504145334 |
oct | 643566441 |
9 | 250032841 |
10 | 110030113 |
11 | 57122286 |
12 | 30a22a01 |
13 | 19a45c9b |
14 | 1088261b |
15 | 99d67ad |
hex | 68eed21 |
110030113 has 2 divisors, whose sum is σ = 110030114. Its totient is φ = 110030112.
The previous prime is 110030087. The next prime is 110030131. The reversal of 110030113 is 311030011.
Together with next prime (110030131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106254864 + 3775249 = 10308^2 + 1943^2 .
It is a cyclic number.
It is not a de Polignac number, because 110030113 - 221 = 107932961 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110030113.
It is not a weakly prime, because it can be changed into another prime (110030513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55015056 + 55015057.
It is an arithmetic number, because the mean of its divisors is an integer number (55015057).
Almost surely, 2110030113 is an apocalyptic number.
It is an amenable number.
110030113 is a deficient number, since it is larger than the sum of its proper divisors (1).
110030113 is an equidigital number, since it uses as much as digits as its factorization.
110030113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9, while the sum is 10.
The square root of 110030113 is about 10489.5239644133. The cubic root of 110030113 is about 479.1857041493.
Adding to 110030113 its reverse (311030011), we get a palindrome (421060124).
It can be divided in two parts, 1100 and 30113, that added together give a palindrome (31213).
The spelling of 110030113 in words is "one hundred ten million, thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •