Base | Representation |
---|---|
bin | 10100101011001110… |
… | …01110010110111000 |
3 | 1001122120122112220100 |
4 | 22111213032112320 |
5 | 140213101202300 |
6 | 5033235555400 |
7 | 542032426521 |
oct | 122547162670 |
9 | 31576575810 |
10 | 11100022200 |
11 | 4786744a73 |
12 | 219945bb60 |
13 | 107b878297 |
14 | 7742a9848 |
15 | 44e74a700 |
hex | 2959ce5b8 |
11100022200 has 144 divisors (see below), whose sum is σ = 38285306280. Its totient is φ = 2879988480.
The previous prime is 11100022189. The next prime is 11100022207. The reversal of 11100022200 is 222000111.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a zygodrome in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100022207) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 16734 + ... + 149933.
Almost surely, 211100022200 is an apocalyptic number.
11100022200 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 11100022200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19142653140).
11100022200 is an abundant number, since it is smaller than the sum of its proper divisors (27185284080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11100022200 is a wasteful number, since it uses less digits than its factorization.
11100022200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 166726 (or 166714 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 11100022200 its reverse (222000111), we get a palindrome (11322022311).
The spelling of 11100022200 in words is "eleven billion, one hundred million, twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •