Base | Representation |
---|---|
bin | 11101010000111110111… |
… | …001110000000101110111 |
3 | 21010021000000111100101002 |
4 | 131100332321300011313 |
5 | 230422213101133421 |
6 | 4135515300553515 |
7 | 265203635061446 |
oct | 35207671600567 |
9 | 7107000440332 |
10 | 2011100021111 |
11 | 7059a2594a55 |
12 | 2859213b289b |
13 | 11785210bcbc |
14 | 6d4a2b58d5d |
15 | 374a7727b0b |
hex | 1d43ee70177 |
2011100021111 has 4 divisors (see below), whose sum is σ = 2011104447672. Its totient is φ = 2011095594552.
The previous prime is 2011100021041. The next prime is 2011100021167. The reversal of 2011100021111 is 1111200011102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2011100021111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011100021092 and 2011100021101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011100021911) 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 in 3 ways as a sum of consecutive naturals, for example, 1442261 + ... + 2470286.
It is an arithmetic number, because the mean of its divisors is an integer number (502776111918).
Almost surely, 22011100021111 is an apocalyptic number.
2011100021111 is a deficient number, since it is larger than the sum of its proper divisors (4426561).
2011100021111 is an equidigital number, since it uses as much as digits as its factorization.
2011100021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4426560.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 2011100021111 its reverse (1111200011102), we get a palindrome (3122300032213).
The spelling of 2011100021111 in words is "two trillion, eleven billion, one hundred million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •