Base | Representation |
---|---|
bin | 10010110101001101… |
… | …00110000000000101 |
3 | 222002120202021100022 |
4 | 21122212212000011 |
5 | 131201130014112 |
6 | 4351112224525 |
7 | 505351410014 |
oct | 113246460005 |
9 | 28076667308 |
10 | 10110001157 |
11 | 4318917563 |
12 | 1b6199b145 |
13 | c51723209 |
14 | 6bc9d8a7b |
15 | 3e288ad72 |
hex | 25a9a6005 |
10110001157 has 2 divisors, whose sum is σ = 10110001158. Its totient is φ = 10110001156.
The previous prime is 10110001093. The next prime is 10110001159. The reversal of 10110001157 is 75110001101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8037839716 + 2072161441 = 89654^2 + 45521^2 .
It is an emirp because it is prime and its reverse (75110001101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10110001157 - 26 = 10110001093 is a prime.
Together with 10110001159, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10110001159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055000578 + 5055000579.
It is an arithmetic number, because the mean of its divisors is an integer number (5055000579).
Almost surely, 210110001157 is an apocalyptic number.
It is an amenable number.
10110001157 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110001157 is an equidigital number, since it uses as much as digits as its factorization.
10110001157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35, while the sum is 17.
Adding to 10110001157 its reverse (75110001101), we get a palindrome (85220002258).
The spelling of 10110001157 in words is "ten billion, one hundred ten million, one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •