Base | Representation |
---|---|
bin | 11101000110101111111… |
… | …010011000101110111100 |
3 | 21002012122011220212202000 |
4 | 131012233322120232330 |
5 | 230232211421023400 |
6 | 4130501030302300 |
7 | 264334421635104 |
oct | 35065772305674 |
9 | 7065564825660 |
10 | 2000111111100 |
11 | 701273641243 |
12 | 2837751b7990 |
13 | 1167c059839b |
14 | 6cb3d534204 |
15 | 37062b29600 |
hex | 1d1afe98bbc |
2000111111100 has 144 divisors (see below), whose sum is σ = 6436857285600. Its totient is φ = 532793064960.
The previous prime is 2000111111099. The next prime is 2000111111123. The reversal of 2000111111100 is 11111110002.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2134606 + ... + 2925194.
Almost surely, 22000111111100 is an apocalyptic number.
2000111111100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2000111111100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3218428642800).
2000111111100 is an abundant number, since it is smaller than the sum of its proper divisors (4436746174500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000111111100 is a wasteful number, since it uses less digits than its factorization.
2000111111100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 791549 (or 791536 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 2000111111100 its reverse (11111110002), we get a palindrome (2011222221102).
The spelling of 2000111111100 in words is "two trillion, one hundred eleven million, one hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •