Base | Representation |
---|---|
bin | 11101011010010011100… |
… | …111011010010011001011 |
3 | 21011012211201022111102121 |
4 | 131122103213122103023 |
5 | 231103213432224321 |
6 | 4144252523312111 |
7 | 266010006560551 |
oct | 35322347322313 |
9 | 7135751274377 |
10 | 2021111211211 |
11 | 70a16a652284 |
12 | 28785607b637 |
13 | 118789216921 |
14 | 6db72591bd1 |
15 | 37891596441 |
hex | 1d6939da4cb |
2021111211211 has 2 divisors, whose sum is σ = 2021111211212. Its totient is φ = 2021111211210.
The previous prime is 2021111211169. The next prime is 2021111211253. The reversal of 2021111211211 is 1121121111202.
It is a balanced prime because it is at equal distance from previous prime (2021111211169) and next prime (2021111211253).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2021111211211 is a prime.
It is not a weakly prime, because it can be changed into another prime (2021111211271) 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, 1010555605605 + 1010555605606.
It is an arithmetic number, because the mean of its divisors is an integer number (1010555605606).
Almost surely, 22021111211211 is an apocalyptic number.
2021111211211 is a deficient number, since it is larger than the sum of its proper divisors (1).
2021111211211 is an equidigital number, since it uses as much as digits as its factorization.
2021111211211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 2021111211211 its reverse (1121121111202), we get a palindrome (3142232322413).
It can be divided in two parts, 2021111 and 211211, that added together give a palindrome (2232322).
The spelling of 2021111211211 in words is "two trillion, twenty-one billion, one hundred eleven million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •