Base | Representation |
---|---|
bin | 110000001101001011110111… |
… | …001001110100000110100011 |
3 | 1000210200011212021010022000211 |
4 | 300031023313021310012203 |
5 | 210242102213441211321 |
6 | 2030525041035154551 |
7 | 62441245662356245 |
oct | 6015136711640643 |
9 | 1023604767108024 |
10 | 212012322210211 |
11 | 6160aa14813056 |
12 | 1b9414a98a5a57 |
13 | 913b8a37b94c3 |
14 | 3a4d645d36095 |
15 | 1979dd8b7a0e1 |
hex | c0d2f72741a3 |
212012322210211 has 2 divisors, whose sum is σ = 212012322210212. Its totient is φ = 212012322210210.
The previous prime is 212012322210163. The next prime is 212012322210233. The reversal of 212012322210211 is 112012223210212.
It is an a-pointer prime, because the next prime (212012322210233) can be obtained adding 212012322210211 to its sum of digits (22).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212012322210211 - 27 = 212012322210083 is a prime.
It is not a weakly prime, because it can be changed into another prime (212012322217211) 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, 106006161105105 + 106006161105106.
It is an arithmetic number, because the mean of its divisors is an integer number (106006161105106).
Almost surely, 2212012322210211 is an apocalyptic number.
212012322210211 is a deficient number, since it is larger than the sum of its proper divisors (1).
212012322210211 is an equidigital number, since it uses as much as digits as its factorization.
212012322210211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 212012322210211 its reverse (112012223210212), we get a palindrome (324024545420423).
The spelling of 212012322210211 in words is "two hundred twelve trillion, twelve billion, three hundred twenty-two million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •