Base | Representation |
---|---|
bin | 10000000000100011000… |
… | …101001110101011110000 |
3 | 10220011112212121111221022 |
4 | 100000203011032223300 |
5 | 121011001122414300 |
6 | 2201213513115012 |
7 | 142323336265220 |
oct | 20004305165360 |
9 | 3804485544838 |
10 | 1100100201200 |
11 | 39460597a700 |
12 | 1592593b8a68 |
13 | 7c97b78c520 |
14 | 3b36090c080 |
15 | 1d939695285 |
hex | 1002314eaf0 |
1100100201200 has 720 divisors, whose sum is σ = 3612375751488. Its totient is φ = 313251840000.
The previous prime is 1100100201199. The next prime is 1100100201217. The reversal of 1100100201200 is 21020010011.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 444843164 + ... + 444845636.
Almost surely, 21100100201200 is an apocalyptic number.
1100100201200 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 1100100201200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1806187875744).
1100100201200 is an abundant number, since it is smaller than the sum of its proper divisors (2512275550288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100100201200 is a wasteful number, since it uses less digits than its factorization.
1100100201200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2634 (or 2612 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 1100100201200 its reverse (21020010011), we get a palindrome (1121120211211).
The spelling of 1100100201200 in words is "one trillion, one hundred billion, one hundred million, two hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •