Base | Representation |
---|---|
bin | 11001000000101101011111… |
… | …100101001110000001100011 |
3 | 112102110220020220021011012022 |
4 | 121000231133211032001203 |
5 | 103404220010304311042 |
6 | 1025541150223452055 |
7 | 32112144550224236 |
oct | 3100553745160143 |
9 | 472426226234168 |
10 | 110000011010147 |
11 | 3205a819580295 |
12 | 104068a515702b |
13 | 494bc58657a3b |
14 | 1d240595a941d |
15 | cab545689cd2 |
hex | 640b5f94e063 |
110000011010147 has 2 divisors, whose sum is σ = 110000011010148. Its totient is φ = 110000011010146.
The previous prime is 110000011010137. The next prime is 110000011010261. The reversal of 110000011010147 is 741010110000011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110000011010147 - 216 = 110000010944611 is a prime.
It is a super-3 number, since 3×1100000110101473 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (110000011010137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000005505073 + 55000005505074.
It is an arithmetic number, because the mean of its divisors is an integer number (55000005505074).
Almost surely, 2110000011010147 is an apocalyptic number.
110000011010147 is a deficient number, since it is larger than the sum of its proper divisors (1).
110000011010147 is an equidigital number, since it uses as much as digits as its factorization.
110000011010147 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28, while the sum is 17.
Adding to 110000011010147 its reverse (741010110000011), we get a palindrome (851010121010158).
The spelling of 110000011010147 in words is "one hundred ten trillion, eleven million, ten thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •