Base | Representation |
---|---|
bin | 111011111011101… |
… | …1011101101001111 |
3 | 12012011002101222100 |
4 | 1313313123231033 |
5 | 13104310120421 |
6 | 531315050143 |
7 | 100556250252 |
oct | 16767335517 |
9 | 5164071870 |
10 | 2011020111 |
11 | 9421941a1 |
12 | 4815a0953 |
13 | 260835339 |
14 | 151127099 |
15 | bb83cc26 |
hex | 77ddbb4f |
2011020111 has 48 divisors (see below), whose sum is σ = 3122525952. Its totient is φ = 1244073600.
The previous prime is 2011020061. The next prime is 2011020113. The reversal of 2011020111 is 1110201102.
It is a happy number.
It is not a de Polignac number, because 2011020111 - 217 = 2010889039 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 2011020093 and 2011020102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011020113) 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 47 ways as a sum of consecutive naturals, for example, 1790196 + ... + 1791318.
It is an arithmetic number, because the mean of its divisors is an integer number (65052624).
Almost surely, 22011020111 is an apocalyptic number.
2011020111 is a deficient number, since it is larger than the sum of its proper divisors (1111505841).
2011020111 is a wasteful number, since it uses less digits than its factorization.
2011020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1404 (or 1401 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
The square root of 2011020111 is about 44844.3988810197. The cubic root of 2011020111 is about 1262.2308909281.
Adding to 2011020111 its reverse (1110201102), we get a palindrome (3121221213).
The spelling of 2011020111 in words is "two billion, eleven million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •