Base | Representation |
---|---|
bin | 1001001011111001011110… |
… | …0000100001111100001001 |
3 | 1022202112220001200122200112 |
4 | 2102332113200201330021 |
5 | 2310434310030001022 |
6 | 33251514110244105 |
7 | 2061462443332601 |
oct | 222762740417411 |
9 | 38675801618615 |
10 | 10100010000137 |
11 | 324443237a3a2 |
12 | 1171548ab6635 |
13 | 583571a598b5 |
14 | 26cbb3633c01 |
15 | 127aceea58e2 |
hex | 92f97821f09 |
10100010000137 has 2 divisors, whose sum is σ = 10100010000138. Its totient is φ = 10100010000136.
The previous prime is 10100010000097. The next prime is 10100010000173. The reversal of 10100010000137 is 73100001000101.
Together with next prime (10100010000173) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8544741613321 + 1555268386816 = 2923139^2 + 1247104^2 .
It is a cyclic number.
It is not a de Polignac number, because 10100010000137 - 234 = 10082830130953 is a prime.
It is not a weakly prime, because it can be changed into another prime (10100010000337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050005000068 + 5050005000069.
It is an arithmetic number, because the mean of its divisors is an integer number (5050005000069).
Almost surely, 210100010000137 is an apocalyptic number.
It is an amenable number.
10100010000137 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100010000137 is an equidigital number, since it uses as much as digits as its factorization.
10100010000137 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 10100010000137 its reverse (73100001000101), we get a palindrome (83200011000238).
The spelling of 10100010000137 in words is "ten trillion, one hundred billion, ten million, one hundred thirty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •