Base | Representation |
---|---|
bin | 10000001010110011011… |
… | …000011110011100111100 |
3 | 10221012222020120010211010 |
4 | 100022303120132130330 |
5 | 121201023420201340 |
6 | 2210234250555220 |
7 | 143163240343512 |
oct | 20126330363474 |
9 | 3835866503733 |
10 | 1111111100220 |
11 | 399246282050 |
12 | 15b410a38b10 |
13 | 80a14a319a4 |
14 | 3bac70184b2 |
15 | 1dd81188b80 |
hex | 102b361e73c |
1111111100220 has 48 divisors (see below), whose sum is σ = 3393939362688. Its totient is φ = 269360266560.
The previous prime is 1111111100189. The next prime is 1111111100243. The reversal of 1111111100220 is 220011111111.
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 = 1111111100196 and 1111111100205.
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, 841750174 + ... + 841751493.
It is an arithmetic number, because the mean of its divisors is an integer number (70707070056).
Almost surely, 21111111100220 is an apocalyptic number.
1111111100220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1111111100220 is an abundant number, since it is smaller than the sum of its proper divisors (2282828262468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111111100220 is a wasteful number, since it uses less digits than its factorization.
1111111100220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1683501690 (or 1683501688 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 1111111100220 its reverse (220011111111), we get a palindrome (1331122211331).
The spelling of 1111111100220 in words is "one trillion, one hundred eleven billion, one hundred eleven million, one hundred thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •