Base | Representation |
---|---|
bin | 1001000110001000101000… |
… | …0011011001000110011001 |
3 | 1022102002022212221000211212 |
4 | 2101202022003121012121 |
5 | 2302324022000311022 |
6 | 33134221310432505 |
7 | 2051356050316613 |
oct | 221421203310631 |
9 | 38362285830755 |
10 | 10001000010137 |
11 | 3206444864484 |
12 | 1156316802735 |
13 | 57712339a1b6 |
14 | 26809dc7ddb3 |
15 | 125237b273e2 |
hex | 9188a0d9199 |
10001000010137 has 2 divisors, whose sum is σ = 10001000010138. Its totient is φ = 10001000010136.
The previous prime is 10001000010017. The next prime is 10001000010187. The reversal of 10001000010137 is 73101000010001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9422714286736 + 578285723401 = 3069644^2 + 760451^2 .
It is a cyclic number.
It is not a de Polignac number, because 10001000010137 - 210 = 10001000009113 is a prime.
It is not a weakly prime, because it can be changed into another prime (10001000010187) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000500005068 + 5000500005069.
It is an arithmetic number, because the mean of its divisors is an integer number (5000500005069).
Almost surely, 210001000010137 is an apocalyptic number.
It is an amenable number.
10001000010137 is a deficient number, since it is larger than the sum of its proper divisors (1).
10001000010137 is an equidigital number, since it uses as much as digits as its factorization.
10001000010137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21, while the sum is 14.
Adding to 10001000010137 its reverse (73101000010001), we get a palindrome (83102000020138).
The spelling of 10001000010137 in words is "ten trillion, one billion, ten thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •