Base | Representation |
---|---|
bin | 10110110000101001011110… |
… | …111001110000100110001001 |
3 | 111010102110212002010101221012 |
4 | 112300221132321300212021 |
5 | 101110020001100001022 |
6 | 552521203501053305 |
7 | 30040664536123316 |
oct | 2660513671604611 |
9 | 433373762111835 |
10 | 100100100000137 |
11 | 29993239933916 |
12 | b2880a0b57235 |
13 | 43b1525599263 |
14 | 1aa0c29263d0d |
15 | b88c776adde2 |
hex | 5b0a5ee70989 |
100100100000137 has 2 divisors, whose sum is σ = 100100100000138. Its totient is φ = 100100100000136.
The previous prime is 100100100000097. The next prime is 100100100000149. The reversal of 100100100000137 is 731000001001001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 52508052107536 + 47592047892601 = 7246244^2 + 6898699^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100100100000137 is a prime.
It is not a weakly prime, because it can be changed into another prime (100100109000137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50050050000068 + 50050050000069.
It is an arithmetic number, because the mean of its divisors is an integer number (50050050000069).
Almost surely, 2100100100000137 is an apocalyptic number.
It is an amenable number.
100100100000137 is a deficient number, since it is larger than the sum of its proper divisors (1).
100100100000137 is an equidigital number, since it uses as much as digits as its factorization.
100100100000137 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 100100100000137 its reverse (731000001001001), we get a palindrome (831100101001138).
The spelling of 100100100000137 in words is "one hundred trillion, one hundred billion, one hundred million, one hundred thirty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •