Base | Representation |
---|---|
bin | 11110111000010111101… |
… | …011000111000010011011 |
3 | 21111212112120021110011022 |
4 | 132320113223013002123 |
5 | 234232040410134321 |
6 | 4302515003553055 |
7 | 306213614026166 |
oct | 36702753070233 |
9 | 7455476243138 |
10 | 2122111021211 |
11 | 748a89391435 |
12 | 2a334282b78b |
13 | 125163bc7bcc |
14 | 749d4310add |
15 | 3a303475dab |
hex | 1ee17ac709b |
2122111021211 has 2 divisors, whose sum is σ = 2122111021212. Its totient is φ = 2122111021210.
The previous prime is 2122111021201. The next prime is 2122111021213. The reversal of 2122111021211 is 1121201112212.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2122111021211 is a prime.
Together with 2122111021213, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2122111021211.
It is not a weakly prime, because it can be changed into another prime (2122111021213) 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, 1061055510605 + 1061055510606.
It is an arithmetic number, because the mean of its divisors is an integer number (1061055510606).
Almost surely, 22122111021211 is an apocalyptic number.
2122111021211 is a deficient number, since it is larger than the sum of its proper divisors (1).
2122111021211 is an equidigital number, since it uses as much as digits as its factorization.
2122111021211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 2122111021211 its reverse (1121201112212), we get a palindrome (3243312133423).
The spelling of 2122111021211 in words is "two trillion, one hundred twenty-two billion, one hundred eleven million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •