Base | Representation |
---|---|
bin | 1100111011000011010… |
… | …1101111101100101101 |
3 | 210020001021101020222202 |
4 | 3032300311233230231 |
5 | 12114134103223432 |
6 | 245553505151245 |
7 | 22016422441502 |
oct | 3166065575455 |
9 | 706037336882 |
10 | 222010211117 |
11 | 86176a81622 |
12 | 3703a92b525 |
13 | 17c21307b36 |
14 | aa6135d4a9 |
15 | 5b9591d462 |
hex | 33b0d6fb2d |
222010211117 has 2 divisors, whose sum is σ = 222010211118. Its totient is φ = 222010211116.
The previous prime is 222010211089. The next prime is 222010211119. The reversal of 222010211117 is 711112010222.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 156641016841 + 65369194276 = 395779^2 + 255674^2 .
It is a cyclic number.
It is not a de Polignac number, because 222010211117 - 212 = 222010207021 is a prime.
Together with 222010211119, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222010211119) 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, 111005105558 + 111005105559.
It is an arithmetic number, because the mean of its divisors is an integer number (111005105559).
Almost surely, 2222010211117 is an apocalyptic number.
It is an amenable number.
222010211117 is a deficient number, since it is larger than the sum of its proper divisors (1).
222010211117 is an equidigital number, since it uses as much as digits as its factorization.
222010211117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 222010211117 its reverse (711112010222), we get a palindrome (933122221339).
The spelling of 222010211117 in words is "two hundred twenty-two billion, ten million, two hundred eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •