Base | Representation |
---|---|
bin | 11101000110101111110… |
… | …110001100001011011100 |
3 | 21002012122002211222211021 |
4 | 131012233312030023130 |
5 | 230232211130323400 |
6 | 4130500550533524 |
7 | 264334406404105 |
oct | 35065766141334 |
9 | 7065562758737 |
10 | 2000110011100 |
11 | 701272a5a853 |
12 | 2837749672a4 |
13 | 1167c02a17b6 |
14 | 6cb3d3293ac |
15 | 370629ad71a |
hex | 1d1afd8c2dc |
2000110011100 has 18 divisors (see below), whose sum is σ = 4340238724304. Its totient is φ = 800044004400.
The previous prime is 2000110011089. The next prime is 2000110011143. The reversal of 2000110011100 is 11100110002.
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 10000549956 + ... + 10000550155.
Almost surely, 22000110011100 is an apocalyptic number.
2000110011100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2000110011100 is an abundant number, since it is smaller than the sum of its proper divisors (2340128713204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000110011100 is a wasteful number, since it uses less digits than its factorization.
2000110011100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20001100125 (or 20001100118 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 2000110011100 its reverse (11100110002), we get a palindrome (2011210121102).
The spelling of 2000110011100 in words is "two trillion, one hundred ten million, eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •