Base | Representation |
---|---|
bin | 10110111101110001100010… |
… | …011011001010010101101001 |
3 | 111020121201002011102210122211 |
4 | 112331301202123022111221 |
5 | 101214304301132021022 |
6 | 554451420351045121 |
7 | 30163106151363046 |
oct | 2675614233122551 |
9 | 436551064383584 |
10 | 101002102220137 |
11 | 2a200829647188 |
12 | b3b2a738107a1 |
13 | 44485c3ac9011 |
14 | 1ad27565221cd |
15 | ba246a88ae77 |
hex | 5bdc626ca569 |
101002102220137 has 2 divisors, whose sum is σ = 101002102220138. Its totient is φ = 101002102220136.
The previous prime is 101002102220101. The next prime is 101002102220177. The reversal of 101002102220137 is 731022201200101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 74219241573481 + 26782860646656 = 8615059^2 + 5175216^2 .
It is an emirp because it is prime and its reverse (731022201200101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101002102220137 - 219 = 101002101695849 is a prime.
It is not a weakly prime, because it can be changed into another prime (101002102220177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50501051110068 + 50501051110069.
It is an arithmetic number, because the mean of its divisors is an integer number (50501051110069).
Almost surely, 2101002102220137 is an apocalyptic number.
It is an amenable number.
101002102220137 is a deficient number, since it is larger than the sum of its proper divisors (1).
101002102220137 is an equidigital number, since it uses as much as digits as its factorization.
101002102220137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 22.
Adding to 101002102220137 its reverse (731022201200101), we get a palindrome (832024303420238).
The spelling of 101002102220137 in words is "one hundred one trillion, two billion, one hundred two million, two hundred twenty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •