Base | Representation |
---|---|
bin | 10010111000011011… |
… | …00111000001010001 |
3 | 222011110120021020122 |
4 | 21130031213001101 |
5 | 131230033144121 |
6 | 4353515120025 |
7 | 506130062552 |
oct | 113415470121 |
9 | 28143507218 |
10 | 10137006161 |
11 | 4332091847 |
12 | 1b6aa43015 |
13 | c571b9bc9 |
14 | 6c2428329 |
15 | 3e4e225ab |
hex | 25c367051 |
10137006161 has 2 divisors, whose sum is σ = 10137006162. Its totient is φ = 10137006160.
The previous prime is 10137006127. The next prime is 10137006163. The reversal of 10137006161 is 16160073101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5959840000 + 4177166161 = 77200^2 + 64631^2 .
It is an emirp because it is prime and its reverse (16160073101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10137006161 - 230 = 9063264337 is a prime.
Together with 10137006163, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10137006161.
It is not a weakly prime, because it can be changed into another prime (10137006163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5068503080 + 5068503081.
It is an arithmetic number, because the mean of its divisors is an integer number (5068503081).
Almost surely, 210137006161 is an apocalyptic number.
It is an amenable number.
10137006161 is a deficient number, since it is larger than the sum of its proper divisors (1).
10137006161 is an equidigital number, since it uses as much as digits as its factorization.
10137006161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 26.
Adding to 10137006161 its reverse (16160073101), we get a palindrome (26297079262).
The spelling of 10137006161 in words is "ten billion, one hundred thirty-seven million, six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •