Base | Representation |
---|---|
bin | 11001000000101101100100… |
… | …111000101110100010100011 |
3 | 112102110220111002201211020121 |
4 | 121000231210320232202203 |
5 | 103404220201100311042 |
6 | 1025541203123221111 |
7 | 32112150010553404 |
oct | 3100554470564243 |
9 | 472426432654217 |
10 | 110000100010147 |
11 | 3205a864839306 |
12 | 1040690ab17797 |
13 | 494bc70c19769 |
14 | 1d240673359ab |
15 | cab54d3ba367 |
hex | 640b64e2e8a3 |
110000100010147 has 2 divisors, whose sum is σ = 110000100010148. Its totient is φ = 110000100010146.
The previous prime is 110000100010109. The next prime is 110000100010189. The reversal of 110000100010147 is 741010001000011.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110000100010147 - 27 = 110000100010019 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110000100010147.
It is not a weakly prime, because it can be changed into another prime (110000100010847) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000050005073 + 55000050005074.
It is an arithmetic number, because the mean of its divisors is an integer number (55000050005074).
Almost surely, 2110000100010147 is an apocalyptic number.
110000100010147 is a deficient number, since it is larger than the sum of its proper divisors (1).
110000100010147 is an equidigital number, since it uses as much as digits as its factorization.
110000100010147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 16.
Adding to 110000100010147 its reverse (741010001000011), we get a palindrome (851010101010158).
The spelling of 110000100010147 in words is "one hundred ten trillion, one hundred million, ten thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •