Base | Representation |
---|---|
bin | 10100110111001010… |
… | …11100110000101000 |
3 | 1001220120012010201101 |
4 | 22123211130300220 |
5 | 140414224021300 |
6 | 5051215331144 |
7 | 544360205131 |
oct | 123345346050 |
9 | 31816163641 |
10 | 11200220200 |
11 | 4828261234 |
12 | 2206b20ab4 |
13 | 109655ac40 |
14 | 78370cc88 |
15 | 45843db6a |
hex | 29b95cc28 |
11200220200 has 96 divisors (see below), whose sum is σ = 28121247000. Its totient is φ = 4124021760.
The previous prime is 11200220189. The next prime is 11200220221. The reversal of 11200220200 is 202200211.
It can be written as a sum of positive squares in 12 ways, for example, as 1516479364 + 9683740836 = 38942^2 + 98406^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 964026 + ... + 975574.
Almost surely, 211200220200 is an apocalyptic number.
11200220200 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 11200220200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14060623500).
11200220200 is an abundant number, since it is smaller than the sum of its proper divisors (16921026800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11200220200 is a wasteful number, since it uses less digits than its factorization.
11200220200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11951 (or 11942 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 11200220200 its reverse (202200211), we get a palindrome (11402420411).
The spelling of 11200220200 in words is "eleven billion, two hundred million, two hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •