Base | Representation |
---|---|
bin | 1001001100011111000110… |
… | …0001011001000110100101 |
3 | 1022210111221221211101212221 |
4 | 2103013301201121012211 |
5 | 2311121001142010432 |
6 | 33300304230512341 |
7 | 2062300645005433 |
oct | 223076141310645 |
9 | 38714857741787 |
10 | 10110110110117 |
11 | 3248745650526 |
12 | 11734a75056b1 |
13 | 5844c13c8934 |
14 | 26d490bb5d53 |
15 | 127ec1a3ab97 |
hex | 931f18591a5 |
10110110110117 has 2 divisors, whose sum is σ = 10110110110118. Its totient is φ = 10110110110116.
The previous prime is 10110110110099. The next prime is 10110110110127. The reversal of 10110110110117 is 71101101101101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8080607854881 + 2029502255236 = 2842641^2 + 1424606^2 .
It is a cyclic number.
It is not a de Polignac number, because 10110110110117 - 235 = 10075750371749 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10110110110117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10110110110127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055055055058 + 5055055055059.
It is an arithmetic number, because the mean of its divisors is an integer number (5055055055059).
Almost surely, 210110110110117 is an apocalyptic number.
It is an amenable number.
10110110110117 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110110110117 is an equidigital number, since it uses as much as digits as its factorization.
10110110110117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7, while the sum is 16.
Adding to 10110110110117 its reverse (71101101101101), we get a palindrome (81211211211218).
The spelling of 10110110110117 in words is "ten trillion, one hundred ten billion, one hundred ten million, one hundred ten thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •