Base | Representation |
---|---|
bin | 1100010110100000111… |
… | …0011011011000000101 |
3 | 202021201201112000122001 |
4 | 3011220032123120011 |
5 | 11434042203310432 |
6 | 241252333305301 |
7 | 21221364216346 |
oct | 3055016333005 |
9 | 667651460561 |
10 | 212202010117 |
11 | 81aa3558a89 |
12 | 35162035231 |
13 | 1701a292bc6 |
14 | a3b08860cd |
15 | 57be7e99e7 |
hex | 316839b605 |
212202010117 has 2 divisors, whose sum is σ = 212202010118. Its totient is φ = 212202010116.
The previous prime is 212202010091. The next prime is 212202010121. The reversal of 212202010117 is 711010202212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 135165787201 + 77036222916 = 367649^2 + 277554^2 .
It is a cyclic number.
It is not a de Polignac number, because 212202010117 - 227 = 212067792389 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212202010094 and 212202010103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212202011117) 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, 106101005058 + 106101005059.
It is an arithmetic number, because the mean of its divisors is an integer number (106101005059).
Almost surely, 2212202010117 is an apocalyptic number.
It is an amenable number.
212202010117 is a deficient number, since it is larger than the sum of its proper divisors (1).
212202010117 is an equidigital number, since it uses as much as digits as its factorization.
212202010117 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 19.
Adding to 212202010117 its reverse (711010202212), we get a palindrome (923212212329).
The spelling of 212202010117 in words is "two hundred twelve billion, two hundred two million, ten thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •