Base | Representation |
---|---|
bin | 10101000011011011… |
… | …11011101010000000 |
3 | 1002011201210100011000 |
4 | 22201231323222000 |
5 | 141122043412300 |
6 | 5105332452000 |
7 | 550046553210 |
oct | 124155735200 |
9 | 32151710130 |
10 | 11303107200 |
11 | 4880344810 |
12 | 223547a000 |
13 | 10b1972818 |
14 | 793252240 |
15 | 4624b3c00 |
hex | 2a1b7ba80 |
11303107200 has 768 divisors, whose sum is σ = 51603840000. Its totient is φ = 2347315200.
The previous prime is 11303107199. The next prime is 11303107219. The reversal of 11303107200 is 270130311.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 6651951 + ... + 6653649.
It is an arithmetic number, because the mean of its divisors is an integer number (67192500).
Almost surely, 211303107200 is an apocalyptic number.
11303107200 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 11303107200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25801920000).
11303107200 is an abundant number, since it is smaller than the sum of its proper divisors (40300732800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11303107200 is a wasteful number, since it uses less digits than its factorization.
11303107200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1750 (or 1727 counting only the distinct ones).
The product of its (nonzero) digits is 126, while the sum is 18.
Adding to 11303107200 its reverse (270130311), we get a palindrome (11573237511).
The spelling of 11303107200 in words is "eleven billion, three hundred three million, one hundred seven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •