Base | Representation |
---|---|
bin | 11110101110001110100… |
… | …010000000010010100101 |
3 | 21110211102120022110222222 |
4 | 132232032202000102211 |
5 | 234042234334033333 |
6 | 4253514200202125 |
7 | 305350001533304 |
oct | 36561642002245 |
9 | 7424376273888 |
10 | 2111220221093 |
11 | 7443aa859085 |
12 | 2a1203469345 |
13 | 1241197b5699 |
14 | 7427db4843b |
15 | 39db72a7298 |
hex | 1eb8e8804a5 |
2111220221093 has 2 divisors, whose sum is σ = 2111220221094. Its totient is φ = 2111220221092.
The previous prime is 2111220221083. The next prime is 2111220221119. The reversal of 2111220221093 is 3901220221112.
It is an a-pointer prime, because the next prime (2111220221119) can be obtained adding 2111220221093 to its sum of digits (26).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1735442639044 + 375777582049 = 1317362^2 + 613007^2 .
It is a cyclic number.
It is not a de Polignac number, because 2111220221093 - 212 = 2111220216997 is a prime.
It is a super-2 number, since 2×21112202210932 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2111220221023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055610110546 + 1055610110547.
It is an arithmetic number, because the mean of its divisors is an integer number (1055610110547).
Almost surely, 22111220221093 is an apocalyptic number.
It is an amenable number.
2111220221093 is a deficient number, since it is larger than the sum of its proper divisors (1).
2111220221093 is an equidigital number, since it uses as much as digits as its factorization.
2111220221093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 26.
The spelling of 2111220221093 in words is "two trillion, one hundred eleven billion, two hundred twenty million, two hundred twenty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •