Base | Representation |
---|---|
bin | 10100101011010111… |
… | …10000101001010100 |
3 | 1001122122212221221010 |
4 | 22111223300221110 |
5 | 140213402224340 |
6 | 5033321252220 |
7 | 542045511201 |
oct | 122553605124 |
9 | 31578787833 |
10 | 11101211220 |
11 | 4787387330 |
12 | 2199934070 |
13 | 107bba3548 |
14 | 7744d8ca8 |
15 | 44e8d2b80 |
hex | 295af0a54 |
11101211220 has 48 divisors (see below), whose sum is σ = 33909156288. Its totient is φ = 2691202560.
The previous prime is 11101211213. The next prime is 11101211221. The reversal of 11101211220 is 2211210111.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 11101211196 and 11101211205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101211221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8409349 + ... + 8410668.
It is an arithmetic number, because the mean of its divisors is an integer number (706440756).
Almost surely, 211101211220 is an apocalyptic number.
11101211220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11101211220 is an abundant number, since it is smaller than the sum of its proper divisors (22807945068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11101211220 is a wasteful number, since it uses less digits than its factorization.
11101211220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16820040 (or 16820038 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11101211220 its reverse (2211210111), we get a palindrome (13312421331).
The spelling of 11101211220 in words is "eleven billion, one hundred one million, two hundred eleven thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •