Base | Representation |
---|---|
bin | 111110111010110… |
… | …1000011001110001 |
3 | 12110010121122012111 |
4 | 1331311220121301 |
5 | 13310432223441 |
6 | 545254325321 |
7 | 103213666315 |
oct | 17565503161 |
9 | 5403548174 |
10 | 2111211121 |
11 | 9937a6188 |
12 | 4ab059841 |
13 | 278514a66 |
14 | 160567b45 |
15 | c552e081 |
hex | 7dd68671 |
2111211121 has 2 divisors, whose sum is σ = 2111211122. Its totient is φ = 2111211120.
The previous prime is 2111211103. The next prime is 2111211139. The reversal of 2111211121 is 1211121112.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (2111211103) and next prime (2111211139).
It can be written as a sum of positive squares in only one way, i.e., 2089495521 + 21715600 = 45711^2 + 4660^2 .
It is a cyclic number.
It is not a de Polignac number, because 2111211121 - 27 = 2111210993 is a prime.
It is not a weakly prime, because it can be changed into another prime (2111214121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055605560 + 1055605561.
It is an arithmetic number, because the mean of its divisors is an integer number (1055605561).
Almost surely, 22111211121 is an apocalyptic number.
It is an amenable number.
2111211121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2111211121 is an equidigital number, since it uses as much as digits as its factorization.
2111211121 is an evil number, because the sum of its binary digits is even.
The product of its digits is 8, while the sum is 13.
The square root of 2111211121 is about 45947.9174827326. The cubic root of 2111211121 is about 1282.8539673779.
Adding to 2111211121 its reverse (1211121112), we get a palindrome (3322332233).
Subtracting from 2111211121 its reverse (1211121112), we obtain a palindrome (900090009).
The spelling of 2111211121 in words is "two billion, one hundred eleven million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •