Base | Representation |
---|---|
bin | 110000001101000010011100… |
… | …011111000010000011000111 |
3 | 1000210122012202121022020120222 |
4 | 300031002130133002003013 |
5 | 210241421012021023421 |
6 | 2030520245443214555 |
7 | 62440440265424231 |
oct | 6015023437020307 |
9 | 1023565677266528 |
10 | 212002211111111 |
11 | 616066a6316703 |
12 | 1b93b54767745b |
13 | 913a951aa0625 |
14 | 3a4cd67133251 |
15 | 19799e6173cab |
hex | c0d09c7c20c7 |
212002211111111 has 2 divisors, whose sum is σ = 212002211111112. Its totient is φ = 212002211111110.
The previous prime is 212002211110913. The next prime is 212002211111183. The reversal of 212002211111111 is 111111112200212.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212002211111111 is a prime.
212002211111111 is a modest number, since divided by 11111111 gives 2120022 as remainder.
It is a self number, because there is not a number n which added to its sum of digits gives 212002211111111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212002211110111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106001105555555 + 106001105555556.
It is an arithmetic number, because the mean of its divisors is an integer number (106001105555556).
Almost surely, 2212002211111111 is an apocalyptic number.
212002211111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
212002211111111 is an equidigital number, since it uses as much as digits as its factorization.
212002211111111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 212002211111111 its reverse (111111112200212), we get a palindrome (323113323311323).
The spelling of 212002211111111 in words is "two hundred twelve trillion, two billion, two hundred eleven million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •