Base | Representation |
---|---|
bin | 10110101111001101001100… |
… | …001001011111101001111001 |
3 | 111010002000001201002012012221 |
4 | 112233031030021133221321 |
5 | 101101404022241011022 |
6 | 552403454204004041 |
7 | 30030556013345551 |
oct | 2657151411375171 |
9 | 433060051065187 |
10 | 100001001110137 |
11 | 29955206119026 |
12 | b270a44b30621 |
13 | 43a50916814ca |
14 | 1a9a107b6c161 |
15 | b863c761ecc7 |
hex | 5af34c25fa79 |
100001001110137 has 2 divisors, whose sum is σ = 100001001110138. Its totient is φ = 100001001110136.
The previous prime is 100001001110111. The next prime is 100001001110141. The reversal of 100001001110137 is 731011100100001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95998824814201 + 4002176295936 = 9797899^2 + 2000544^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100001001110137 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100001001110137.
It is not a weakly prime, because it can be changed into another prime (100001001110147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50000500555068 + 50000500555069.
It is an arithmetic number, because the mean of its divisors is an integer number (50000500555069).
Almost surely, 2100001001110137 is an apocalyptic number.
It is an amenable number.
100001001110137 is a deficient number, since it is larger than the sum of its proper divisors (1).
100001001110137 is an equidigital number, since it uses as much as digits as its factorization.
100001001110137 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 16.
Adding to 100001001110137 its reverse (731011100100001), we get a palindrome (831012101210138).
The spelling of 100001001110137 in words is "one hundred trillion, one billion, one million, one hundred ten thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •