Base | Representation |
---|---|
bin | 11101011010011010001… |
… | …110111000100100011111 |
3 | 21011020010110012102202102 |
4 | 131122122032320210133 |
5 | 231103430342101421 |
6 | 4144311530515315 |
7 | 266012525262521 |
oct | 35323216704437 |
9 | 7136113172672 |
10 | 2021222222111 |
11 | 70a217284424 |
12 | 287887295b3b |
13 | 1187a6214151 |
14 | 6db8320ba11 |
15 | 3789b1c360b |
hex | 1d69a3b891f |
2021222222111 has 2 divisors, whose sum is σ = 2021222222112. Its totient is φ = 2021222222110.
The previous prime is 2021222222021. The next prime is 2021222222113. The reversal of 2021222222111 is 1112222221202.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2021222222111 is a prime.
Together with 2021222222113, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2021222222113) 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, 1010611111055 + 1010611111056.
It is an arithmetic number, because the mean of its divisors is an integer number (1010611111056).
Almost surely, 22021222222111 is an apocalyptic number.
2021222222111 is a deficient number, since it is larger than the sum of its proper divisors (1).
2021222222111 is an equidigital number, since it uses as much as digits as its factorization.
2021222222111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 2021222222111 its reverse (1112222221202), we get a palindrome (3133444443313).
Subtracting from 2021222222111 its reverse (1112222221202), we obtain a palindrome (909000000909).
The spelling of 2021222222111 in words is "two trillion, twenty-one billion, two hundred twenty-two million, two hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •