Base | Representation |
---|---|
bin | 11101000110101111110… |
… | …110111101000000100111 |
3 | 21002012122010020011012002 |
4 | 131012233312331000213 |
5 | 230232211203223421 |
6 | 4130500555115515 |
7 | 264334411166165 |
oct | 35065766750047 |
9 | 7065563204162 |
10 | 2000110211111 |
11 | 701273087051 |
12 | 283774a42b9b |
13 | 1167c034184c |
14 | 6cb3d37c235 |
15 | 370629ecb0b |
hex | 1d1afdbd027 |
2000110211111 has 2 divisors, whose sum is σ = 2000110211112. Its totient is φ = 2000110211110.
The previous prime is 2000110211107. The next prime is 2000110211131. The reversal of 2000110211111 is 1111120110002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2000110211111 - 22 = 2000110211107 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2000110211092 and 2000110211101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2000110211131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000055105555 + 1000055105556.
It is an arithmetic number, because the mean of its divisors is an integer number (1000055105556).
Almost surely, 22000110211111 is an apocalyptic number.
2000110211111 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000110211111 is an equidigital number, since it uses as much as digits as its factorization.
2000110211111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 2000110211111 its reverse (1111120110002), we get a palindrome (3111230321113).
The spelling of 2000110211111 in words is "two trillion, one hundred ten million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •