Base | Representation |
---|---|
bin | 11110101110001101100… |
… | …001100000001001010101 |
3 | 21110211101101111102101011 |
4 | 132232031201200021111 |
5 | 234042221021442323 |
6 | 4253512353532221 |
7 | 305346405030262 |
oct | 36561541401125 |
9 | 7424341442334 |
10 | 2111203312213 |
11 | 7443a125a1a6 |
12 | 2a11b9874071 |
13 | 124116145228 |
14 | 7427b7c6269 |
15 | 39db5a6720d |
hex | 1eb8d860255 |
2111203312213 has 2 divisors, whose sum is σ = 2111203312214. Its totient is φ = 2111203312212.
The previous prime is 2111203312187. The next prime is 2111203312217. The reversal of 2111203312213 is 3122133021112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2019516683409 + 91686628804 = 1421097^2 + 302798^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2111203312213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2111203312217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055601656106 + 1055601656107.
It is an arithmetic number, because the mean of its divisors is an integer number (1055601656107).
Almost surely, 22111203312213 is an apocalyptic number.
It is an amenable number.
2111203312213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2111203312213 is an equidigital number, since it uses as much as digits as its factorization.
2111203312213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 2111203312213 its reverse (3122133021112), we get a palindrome (5233336333325).
The spelling of 2111203312213 in words is "two trillion, one hundred eleven billion, two hundred three million, three hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •