Base | Representation |
---|---|
bin | 1100010010000101001… |
… | …0111110111100000101 |
3 | 202011122210100100211212 |
4 | 3010201102332330011 |
5 | 11424123034201041 |
6 | 240534303541205 |
7 | 21150034410323 |
oct | 3044122767405 |
9 | 664583310755 |
10 | 211012022021 |
11 | 81542870349 |
12 | 34a8b5ba805 |
13 | 16b8a895838 |
14 | a2da800d13 |
15 | 57500da8eb |
hex | 31214bef05 |
211012022021 has 2 divisors, whose sum is σ = 211012022022. Its totient is φ = 211012022020.
The previous prime is 211012021993. The next prime is 211012022047. The reversal of 211012022021 is 120220210112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 122770348996 + 88241673025 = 350386^2 + 297055^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211012022021 is a prime.
It is a super-3 number, since 3×2110120220213 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211012021987 and 211012022005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211012022321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105506011010 + 105506011011.
It is an arithmetic number, because the mean of its divisors is an integer number (105506011011).
Almost surely, 2211012022021 is an apocalyptic number.
It is an amenable number.
211012022021 is a deficient number, since it is larger than the sum of its proper divisors (1).
211012022021 is an equidigital number, since it uses as much as digits as its factorization.
211012022021 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 211012022021 its reverse (120220210112), we get a palindrome (331232232133).
The spelling of 211012022021 in words is "two hundred eleven billion, twelve million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •