| Base | Representation |
|---|---|
| bin | 10000000000101001000… |
| … | …001111100000111010000 |
| 3 | 10220011210211101220220020 |
| 4 | 100000221001330013100 |
| 5 | 121011202200031000 |
| 6 | 2201231440143440 |
| 7 | 142325660500521 |
| oct | 20005101740720 |
| 9 | 3804724356806 |
| 10 | 1100200002000 |
| 11 | 394657245500 |
| 12 | 159286907b80 |
| 13 | 7c996363458 |
| 14 | 3b36dc8a848 |
| 15 | 1d94330aba0 |
| hex | 1002907c1d0 |
1100200002000 has 480 divisors, whose sum is σ = 3934869818880. Its totient is φ = 264249216000.
The previous prime is 1100200001981. The next prime is 1100200002017. The reversal of 1100200002000 is 2000020011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a self number, because there is not a number n which added to its sum of digits gives 1100200002000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 79127049 + ... + 79140951.
It is an arithmetic number, because the mean of its divisors is an integer number (8197645456).
Almost surely, 21100200002000 is an apocalyptic number.
1100200002000 is a gapful number since it is divisible by the number (10) 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 1100200002000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1967434909440).
1100200002000 is an abundant number, since it is smaller than the sum of its proper divisors (2834669816880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100200002000 is a wasteful number, since it uses less digits than its factorization.
1100200002000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14060 (or 14033 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 6.
Adding to 1100200002000 its reverse (2000020011), we get a palindrome (1102200022011).
It can be divided in two parts, 1 and 100200002000, that added together give a palindrome (100200002001).
The spelling of 1100200002000 in words is "one trillion, one hundred billion, two hundred million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •