Base | Representation |
---|---|
bin | 110011011101011110… |
… | …0011110111110110001 |
3 | 101120020200012011001101 |
4 | 1212322330132332301 |
5 | 3302311203200423 |
6 | 122433505404401 |
7 | 10661361413344 |
oct | 1467274367661 |
9 | 346220164041 |
10 | 110510600113 |
11 | 4295a397581 |
12 | 19501939701 |
13 | a562223a54 |
14 | 54c4d3845b |
15 | 2d1bd567ad |
hex | 19baf1efb1 |
110510600113 has 2 divisors, whose sum is σ = 110510600114. Its totient is φ = 110510600112.
The previous prime is 110510600111. The next prime is 110510600141. The reversal of 110510600113 is 311006015011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 105695211664 + 4815388449 = 325108^2 + 69393^2 .
It is an emirp because it is prime and its reverse (311006015011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110510600113 - 21 = 110510600111 is a prime.
It is a super-2 number, since 2×1105106001132 (a number of 23 digits) contains 22 as substring.
Together with 110510600111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (110510600111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55255300056 + 55255300057.
It is an arithmetic number, because the mean of its divisors is an integer number (55255300057).
Almost surely, 2110510600113 is an apocalyptic number.
It is an amenable number.
110510600113 is a deficient number, since it is larger than the sum of its proper divisors (1).
110510600113 is an equidigital number, since it uses as much as digits as its factorization.
110510600113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 90, while the sum is 19.
Adding to 110510600113 its reverse (311006015011), we get a palindrome (421516615124).
The spelling of 110510600113 in words is "one hundred ten billion, five hundred ten million, six hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •