Base | Representation |
---|---|
bin | 1100010110001011001… |
… | …1010010010011111001 |
3 | 202021111101021200120221 |
4 | 3011202303102103321 |
5 | 11433400404242032 |
6 | 241235323020041 |
7 | 21216210554125 |
oct | 3054263222371 |
9 | 667441250527 |
10 | 212111009017 |
11 | 81a57153566 |
12 | 3513766a621 |
13 | 170044803bb |
14 | a3a2758585 |
15 | 57b6821597 |
hex | 3162cd24f9 |
212111009017 has 2 divisors, whose sum is σ = 212111009018. Its totient is φ = 212111009016.
The previous prime is 212111008997. The next prime is 212111009021. The reversal of 212111009017 is 710900111212.
212111009017 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 120401366121 + 91709642896 = 346989^2 + 302836^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212111009017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212111008982 and 212111009000.
It is not a weakly prime, because it can be changed into another prime (212111009087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106055504508 + 106055504509.
It is an arithmetic number, because the mean of its divisors is an integer number (106055504509).
Almost surely, 2212111009017 is an apocalyptic number.
It is an amenable number.
212111009017 is a deficient number, since it is larger than the sum of its proper divisors (1).
212111009017 is an equidigital number, since it uses as much as digits as its factorization.
212111009017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 25.
The spelling of 212111009017 in words is "two hundred twelve billion, one hundred eleven million, nine thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •