Base | Representation |
---|---|
bin | 11110110111011011011… |
… | …010011010011011001011 |
3 | 21111202221002212211011111 |
4 | 132313123122122123023 |
5 | 234223003100324321 |
6 | 4302230410311151 |
7 | 306146556421156 |
oct | 36673332323313 |
9 | 7452832784144 |
10 | 2121100011211 |
11 | 74860a728685 |
12 | 2a31001284b7 |
13 | 12503260453c |
14 | 74939d38c9d |
15 | 3a29481c5e1 |
hex | 1eddb69a6cb |
2121100011211 has 2 divisors, whose sum is σ = 2121100011212. Its totient is φ = 2121100011210.
The previous prime is 2121100011193. The next prime is 2121100011227. The reversal of 2121100011211 is 1121100011212.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2121100011211 - 25 = 2121100011179 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2121100011191 and 2121100011200.
It is not a weakly prime, because it can be changed into another prime (2121100014211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1060550005605 + 1060550005606.
It is an arithmetic number, because the mean of its divisors is an integer number (1060550005606).
Almost surely, 22121100011211 is an apocalyptic number.
2121100011211 is a deficient number, since it is larger than the sum of its proper divisors (1).
2121100011211 is an equidigital number, since it uses as much as digits as its factorization.
2121100011211 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 2121100011211 its reverse (1121100011212), we get a palindrome (3242200022423).
Subtracting from 2121100011211 its reverse (1121100011212), we obtain a palindrome (999999999999).
It can be divided in two parts, 212110001 and 1211, that added together give a palindrome (212111212).
The spelling of 2121100011211 in words is "two trillion, one hundred twenty-one billion, one hundred million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •