Base | Representation |
---|---|
bin | 11101010000111010001… |
… | …000011111111101001101 |
3 | 21010020210102220220120000 |
4 | 131100322020133331031 |
5 | 230422032110013401 |
6 | 4135503321514513 |
7 | 265201643653116 |
oct | 35207210377515 |
9 | 7106712826500 |
10 | 2011020001101 |
11 | 7059613aa811 |
12 | 2858ba642a39 |
13 | 11783b672797 |
14 | 6d49628920d |
15 | 374a06bd186 |
hex | 1d43a21ff4d |
2011020001101 has 20 divisors (see below), whose sum is σ = 3023250815772. Its totient is φ = 1332140629248.
The previous prime is 2011020001073. The next prime is 2011020001141. The reversal of 2011020001101 is 1011000201102.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 900883824201 + 1110136176900 = 949149^2 + 1053630^2 .
It is not a de Polignac number, because 2011020001101 - 27 = 2011020000973 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011020001141) 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 19 ways as a sum of consecutive naturals, for example, 79055460 + ... + 79080893.
Almost surely, 22011020001101 is an apocalyptic number.
It is an amenable number.
2011020001101 is a deficient number, since it is larger than the sum of its proper divisors (1012230814671).
2011020001101 is a wasteful number, since it uses less digits than its factorization.
2011020001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158136522 (or 158136513 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2011020001101 its reverse (1011000201102), we get a palindrome (3022020202203).
The spelling of 2011020001101 in words is "two trillion, eleven billion, twenty million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •