Base | Representation |
---|---|
bin | 1100110011100110100… |
… | …0000000001110110101 |
3 | 210000212212212002221022 |
4 | 3030321220000032311 |
5 | 12101040042320432 |
6 | 245023220230525 |
7 | 21616025110424 |
oct | 3147150001665 |
9 | 700785762838 |
10 | 220010120117 |
11 | 8533aa82657 |
12 | 36780b3b445 |
13 | 17992b2b238 |
14 | a91187d2bb |
15 | 5aca03db12 |
hex | 3339a003b5 |
220010120117 has 2 divisors, whose sum is σ = 220010120118. Its totient is φ = 220010120116.
The previous prime is 220010120111. The next prime is 220010120159. The reversal of 220010120117 is 711021010022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 204051861841 + 15958258276 = 451721^2 + 126326^2 .
It is a cyclic number.
It is not a de Polignac number, because 220010120117 - 212 = 220010116021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220010120095 and 220010120104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220010120111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110005060058 + 110005060059.
It is an arithmetic number, because the mean of its divisors is an integer number (110005060059).
Almost surely, 2220010120117 is an apocalyptic number.
It is an amenable number.
220010120117 is a deficient number, since it is larger than the sum of its proper divisors (1).
220010120117 is an equidigital number, since it uses as much as digits as its factorization.
220010120117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 17.
Adding to 220010120117 its reverse (711021010022), we get a palindrome (931031130139).
The spelling of 220010120117 in words is "two hundred twenty billion, ten million, one hundred twenty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •