Base | Representation |
---|---|
bin | 11001000000101101100101… |
… | …100011000010000011101001 |
3 | 112102110220111212121020211222 |
4 | 121000231211203002003221 |
5 | 103404220211420201022 |
6 | 1025541204201031425 |
7 | 32112150204042626 |
oct | 3100554543020351 |
9 | 472426455536758 |
10 | 110000111100137 |
11 | 3205a870023395 |
12 | 10406912785575 |
13 | 494bc7330049b |
14 | 1d240689c134d |
15 | cab54e35b242 |
hex | 640b658c20e9 |
110000111100137 has 2 divisors, whose sum is σ = 110000111100138. Its totient is φ = 110000111100136.
The previous prime is 110000111100079. The next prime is 110000111100163. The reversal of 110000111100137 is 731001111000011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 62252163120016 + 47747947980121 = 7890004^2 + 6909989^2 .
It is a cyclic number.
It is not a de Polignac number, because 110000111100137 - 28 = 110000111099881 is a prime.
It is not a weakly prime, because it can be changed into another prime (110000111100437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000055550068 + 55000055550069.
It is an arithmetic number, because the mean of its divisors is an integer number (55000055550069).
Almost surely, 2110000111100137 is an apocalyptic number.
It is an amenable number.
110000111100137 is a deficient number, since it is larger than the sum of its proper divisors (1).
110000111100137 is an equidigital number, since it uses as much as digits as its factorization.
110000111100137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21, while the sum is 17.
Adding to 110000111100137 its reverse (731001111000011), we get a palindrome (841001222100148).
The spelling of 110000111100137 in words is "one hundred ten trillion, one hundred eleven million, one hundred thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •