Base | Representation |
---|---|
bin | 11101000110101111110… |
… | …110111010100010110011 |
3 | 21002012122010012122100000 |
4 | 131012233312322202303 |
5 | 230232211202413021 |
6 | 4130500555001043 |
7 | 264334411124556 |
oct | 35065766724263 |
9 | 7065563178300 |
10 | 2000110201011 |
11 | 70127307a4aa |
12 | 283774a39183 |
13 | 1167c033a080 |
14 | 6cb3d37869d |
15 | 370629e9b26 |
hex | 1d1afdba8b3 |
2000110201011 has 48 divisors (see below), whose sum is σ = 3227807928800. Its totient is φ = 1230343914240.
The previous prime is 2000110200989. The next prime is 2000110201027. The reversal of 2000110201011 is 1101020110002.
It is a happy number.
It is not a de Polignac number, because 2000110201011 - 213 = 2000110192819 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 = 2000110200984 and 2000110201002.
It is not an unprimeable number, because it can be changed into a prime (2000110201051) 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, 7838265 + ... + 8089413.
Almost surely, 22000110201011 is an apocalyptic number.
2000110201011 is a deficient number, since it is larger than the sum of its proper divisors (1227697727789).
2000110201011 is a wasteful number, since it uses less digits than its factorization.
2000110201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253698 (or 253686 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2000110201011 its reverse (1101020110002), we get a palindrome (3101130311013).
The spelling of 2000110201011 in words is "two trillion, one hundred ten million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •