Base | Representation |
---|---|
bin | 10000001010111000101… |
… | …111110011000110111100 |
3 | 10221020012111220121121110 |
4 | 100022320233303012330 |
5 | 121201214440201340 |
6 | 2210251224002020 |
7 | 143165412336261 |
oct | 20127057630674 |
9 | 3836174817543 |
10 | 1111201100220 |
11 | 399292063412 |
12 | 15b437000310 |
13 | 80a2a583923 |
14 | 3bad4d65268 |
15 | 1dd89015680 |
hex | 102b8bf31bc |
1111201100220 has 24 divisors (see below), whose sum is σ = 3111363080784. Its totient is φ = 296320293376.
The previous prime is 1111201100209. The next prime is 1111201100237. The reversal of 1111201100220 is 220011021111.
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 = 1111201100196 and 1111201100205.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9260009109 + ... + 9260009228.
It is an arithmetic number, because the mean of its divisors is an integer number (129640128366).
Almost surely, 21111201100220 is an apocalyptic number.
1111201100220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1111201100220 is an abundant number, since it is smaller than the sum of its proper divisors (2000161980564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111201100220 is a wasteful number, since it uses less digits than its factorization.
1111201100220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18520018349 (or 18520018347 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1111201100220 its reverse (220011021111), we get a palindrome (1331212121331).
The spelling of 1111201100220 in words is "one trillion, one hundred eleven billion, two hundred one million, one hundred thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •