Base | Representation |
---|---|
bin | 11101010000111111101… |
… | …011110000110001100111 |
3 | 21010021000221011101220122 |
4 | 131100333223300301213 |
5 | 230422224430143421 |
6 | 4135520445552155 |
7 | 265204154363150 |
oct | 35207753606147 |
9 | 7107027141818 |
10 | 2011113131111 |
11 | 7059a9a29767 |
12 | 28592587565b |
13 | 117854a4c2b6 |
14 | 6d4a47ac927 |
15 | 374a89672ab |
hex | 1d43faf0c67 |
2011113131111 has 48 divisors (see below), whose sum is σ = 2417666334720. Its totient is φ = 1638498032640.
The previous prime is 2011113131063. The next prime is 2011113131141. The reversal of 2011113131111 is 1111313111102.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-2011113131111 is a prime.
It is a super-2 number, since 2×20111131311112 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2011113131111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011113131141) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 109059230 + ... + 109077668.
It is an arithmetic number, because the mean of its divisors is an integer number (50368048640).
Almost surely, 22011113131111 is an apocalyptic number.
2011113131111 is a deficient number, since it is larger than the sum of its proper divisors (406553203609).
2011113131111 is a wasteful number, since it uses less digits than its factorization.
2011113131111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18792 (or 18763 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 17.
Adding to 2011113131111 its reverse (1111313111102), we get a palindrome (3122426242213).
The spelling of 2011113131111 in words is "two trillion, eleven billion, one hundred thirteen million, one hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •