Base | Representation |
---|---|
bin | 1001000110001000110101… |
… | …01010101101001010010101 |
3 | 2121211011221102222200211221 |
4 | 10203010122222231022111 |
5 | 10110203310141200432 |
6 | 110312501552530341 |
7 | 4133050635413155 |
oct | 443043252551225 |
9 | 77734842880757 |
10 | 20002110100117 |
11 | 6411935774532 |
12 | 22b06622509b1 |
13 | b212634c9ba2 |
14 | 4d21705b6765 |
15 | 24a47a245b97 |
hex | 12311aaad295 |
20002110100117 has 2 divisors, whose sum is σ = 20002110100118. Its totient is φ = 20002110100116.
The previous prime is 20002110100097. The next prime is 20002110100153. The reversal of 20002110100117 is 71100101120002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16588628451396 + 3413481648721 = 4072914^2 + 1847561^2 .
It is a cyclic number.
It is not a de Polignac number, because 20002110100117 - 239 = 19452354286229 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20002110100117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20002110100417) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10001055050058 + 10001055050059.
It is an arithmetic number, because the mean of its divisors is an integer number (10001055050059).
Almost surely, 220002110100117 is an apocalyptic number.
It is an amenable number.
20002110100117 is a deficient number, since it is larger than the sum of its proper divisors (1).
20002110100117 is an equidigital number, since it uses as much as digits as its factorization.
20002110100117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28, while the sum is 16.
Adding to 20002110100117 its reverse (71100101120002), we get a palindrome (91102211220119).
The spelling of 20002110100117 in words is "twenty trillion, two billion, one hundred ten million, one hundred thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •