Base | Representation |
---|---|
bin | 11110101110000010000… |
… | …011111011100110111001 |
3 | 21110210212222122111201001 |
4 | 132232002003323212321 |
5 | 234041322304323001 |
6 | 4253441324125001 |
7 | 305341551346324 |
oct | 36560203734671 |
9 | 7423788574631 |
10 | 2111011011001 |
11 | 744302755482 |
12 | 2a1165396761 |
13 | 1240b5355229 |
14 | 742600497bb |
15 | 39da3c2e001 |
hex | 1eb820fb9b9 |
2111011011001 has 2 divisors, whose sum is σ = 2111011011002. Its totient is φ = 2111011011000.
The previous prime is 2111011010921. The next prime is 2111011011017. The reversal of 2111011011001 is 1001101101112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2110802179600 + 208831401 = 1452860^2 + 14451^2 .
It is a cyclic number.
It is not a de Polignac number, because 2111011011001 - 213 = 2111011002809 is a prime.
It is not a weakly prime, because it can be changed into another prime (2111011011041) 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, 1055505505500 + 1055505505501.
It is an arithmetic number, because the mean of its divisors is an integer number (1055505505501).
Almost surely, 22111011011001 is an apocalyptic number.
It is an amenable number.
2111011011001 is a deficient number, since it is larger than the sum of its proper divisors (1).
2111011011001 is an equidigital number, since it uses as much as digits as its factorization.
2111011011001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 2111011011001 its reverse (1001101101112), we get a palindrome (3112112112113).
The spelling of 2111011011001 in words is "two trillion, one hundred eleven billion, eleven million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •