Base | Representation |
---|---|
bin | 101111001000010010… |
… | …1111011100011001111 |
3 | 100200020111200022022111 |
4 | 1132100211323203033 |
5 | 3124234242011114 |
6 | 114254551524451 |
7 | 10212036512314 |
oct | 1362045734317 |
9 | 320214608274 |
10 | 101210110159 |
11 | 39a17517844 |
12 | 17747089727 |
13 | 970c433962 |
14 | 4c81a62d0b |
15 | 29755c0bc4 |
hex | 179097b8cf |
101210110159 has 2 divisors, whose sum is σ = 101210110160. Its totient is φ = 101210110158.
The previous prime is 101210110103. The next prime is 101210110201. The reversal of 101210110159 is 951011012101.
It is a strong prime.
It is an emirp because it is prime and its reverse (951011012101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101210110159 - 27 = 101210110031 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101210110559) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50605055079 + 50605055080.
It is an arithmetic number, because the mean of its divisors is an integer number (50605055080).
Almost surely, 2101210110159 is an apocalyptic number.
101210110159 is a deficient number, since it is larger than the sum of its proper divisors (1).
101210110159 is an equidigital number, since it uses as much as digits as its factorization.
101210110159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 22.
The spelling of 101210110159 in words is "one hundred one billion, two hundred ten million, one hundred ten thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •