Base | Representation |
---|---|
bin | 1100010110001011011… |
… | …1110101000101010101 |
3 | 202021111110112012100012 |
4 | 3011202313311011111 |
5 | 11433401210400041 |
6 | 241235404330005 |
7 | 21216223644341 |
oct | 3054267650525 |
9 | 667443465305 |
10 | 212112200021 |
11 | 81a57897367 |
12 | 35137b43905 |
13 | 170047a9537 |
14 | a3a2988621 |
15 | 57b69a93eb |
hex | 3162df5155 |
212112200021 has 2 divisors, whose sum is σ = 212112200022. Its totient is φ = 212112200020.
The previous prime is 212112200017. The next prime is 212112200033. The reversal of 212112200021 is 120002211212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 211696611025 + 415588996 = 460105^2 + 20386^2 .
It is a cyclic number.
It is not a de Polignac number, because 212112200021 - 22 = 212112200017 is a prime.
It is a super-3 number, since 3×2121122000213 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212112199969 and 212112200005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212112200621) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106056100010 + 106056100011.
It is an arithmetic number, because the mean of its divisors is an integer number (106056100011).
Almost surely, 2212112200021 is an apocalyptic number.
It is an amenable number.
212112200021 is a deficient number, since it is larger than the sum of its proper divisors (1).
212112200021 is an equidigital number, since it uses as much as digits as its factorization.
212112200021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 212112200021 its reverse (120002211212), we get a palindrome (332114411233).
The spelling of 212112200021 in words is "two hundred twelve billion, one hundred twelve million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •