Base | Representation |
---|---|
bin | 111110111010100… |
… | …1111111111010001 |
3 | 12110010102120000210 |
4 | 1331311033333101 |
5 | 13310421023441 |
6 | 545252234333 |
7 | 103213101630 |
oct | 17565177721 |
9 | 5403376023 |
10 | 2111111121 |
11 | 993738039 |
12 | 4ab00b9a9 |
13 | 2784ab3a2 |
14 | 16053d517 |
15 | c550e616 |
hex | 7dd4ffd1 |
2111111121 has 16 divisors (see below), whose sum is σ = 3226160000. Its totient is φ = 1202888448.
The previous prime is 2111111099. The next prime is 2111111137. The reversal of 2111111121 is 1211111112.
It is not a de Polignac number, because 2111111121 - 210 = 2111110097 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2111111097 and 2111111106.
It is not an unprimeable number, because it can be changed into a prime (2111111141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 136696 + ... + 151353.
It is an arithmetic number, because the mean of its divisors is an integer number (201635000).
Almost surely, 22111111121 is an apocalyptic number.
2111111121 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2111111121 is a deficient number, since it is larger than the sum of its proper divisors (1115048879).
2111111121 is a wasteful number, since it uses less digits than its factorization.
2111111121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 288408.
The product of its digits is 4, while the sum is 12.
The square root of 2111111121 is about 45946.8292812464. The cubic root of 2111111121 is about 1282.8337124286.
Adding to 2111111121 its reverse (1211111112), we get a palindrome (3322222233).
Subtracting from 2111111121 its reverse (1211111112), we obtain a palindrome (900000009).
The spelling of 2111111121 in words is "two billion, one hundred eleven million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •