Base | Representation |
---|---|
bin | 10100100000101000… |
… | …00001010111111000 |
3 | 1001102101022221121000 |
4 | 22100110001113320 |
5 | 140022320232300 |
6 | 5020342045000 |
7 | 536602552530 |
oct | 122024012770 |
9 | 31371287530 |
10 | 11011102200 |
11 | 474053106a |
12 | 2173719760 |
13 | 1066313ab7 |
14 | 7665604c0 |
15 | 446a33c00 |
hex | 2905015f8 |
11011102200 has 192 divisors, whose sum is σ = 43345440000. Its totient is φ = 2516814720.
The previous prime is 11011102187. The next prime is 11011102247. The reversal of 11011102200 is 220111011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
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 47 ways as a sum of consecutive naturals, for example, 107850 + ... + 183449.
It is an arithmetic number, because the mean of its divisors is an integer number (225757500).
Almost surely, 211011102200 is an apocalyptic number.
11011102200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11011102200 is an abundant number, since it is smaller than the sum of its proper divisors (32334337800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011102200 is a wasteful number, since it uses less digits than its factorization.
11011102200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291331 (or 291316 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11011102200 its reverse (220111011), we get a palindrome (11231213211).
The spelling of 11011102200 in words is "eleven billion, eleven million, one hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •