Base | Representation |
---|---|
bin | 10110101111001101001100… |
… | …001001011111101010000011 |
3 | 111010002000001201002012020022 |
4 | 112233031030021133222003 |
5 | 101101404022241011042 |
6 | 552403454204004055 |
7 | 30030556013345564 |
oct | 2657151411375203 |
9 | 433060051065208 |
10 | 100001001110147 |
11 | 29955206119035 |
12 | b270a44b3062b |
13 | 43a5091681507 |
14 | 1a9a107b6c16b |
15 | b863c761ecd2 |
hex | 5af34c25fa83 |
100001001110147 has 2 divisors, whose sum is σ = 100001001110148. Its totient is φ = 100001001110146.
The previous prime is 100001001110141. The next prime is 100001001110167. The reversal of 100001001110147 is 741011100100001.
It is a weak prime.
It is an emirp because it is prime and its reverse (741011100100001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100001001110147 - 242 = 95602954599043 is a prime.
It is not a weakly prime, because it can be changed into another prime (100001001110141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000500555073 + 50000500555074.
It is an arithmetic number, because the mean of its divisors is an integer number (50000500555074).
Almost surely, 2100001001110147 is an apocalyptic number.
100001001110147 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001001110147 is an equidigital number, since it uses as much as digits as its factorization.
100001001110147 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 17.
Adding to 100001001110147 its reverse (741011100100001), we get a palindrome (841012101210148).
The spelling of 100001001110147 in words is "one hundred trillion, one billion, one million, one hundred ten thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •