Base | Representation |
---|---|
bin | 10100101011010111… |
… | …01101111101011100 |
3 | 1001122122212101211201 |
4 | 22111223231331130 |
5 | 140213401401340 |
6 | 5033321125244 |
7 | 542045434135 |
oct | 122553557534 |
9 | 31578771751 |
10 | 11101200220 |
11 | 478737a040 |
12 | 2199929824 |
13 | 107bb9b536 |
14 | 7744d4c8c |
15 | 44e8ce79a |
hex | 295aedf5c |
11101200220 has 48 divisors (see below), whose sum is σ = 25477296768. Its totient is φ = 4029584960.
The previous prime is 11101200193. The next prime is 11101200247. The reversal of 11101200220 is 2200210111.
It is an interprime number because it is at equal distance from previous prime (11101200193) and next prime (11101200247).
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 11101200197 and 11101200206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 79047 + ... + 168673.
It is an arithmetic number, because the mean of its divisors is an integer number (530777016).
Almost surely, 211101200220 is an apocalyptic number.
11101200220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11101200220 is an abundant number, since it is smaller than the sum of its proper divisors (14376096548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11101200220 is a wasteful number, since it uses less digits than its factorization.
11101200220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90210 (or 90208 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 11101200220 its reverse (2200210111), we get a palindrome (13301410331).
The spelling of 11101200220 in words is "eleven billion, one hundred one million, two hundred thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •