Base | Representation |
---|---|
bin | 110011110010000011… |
… | …0111101001101010100 |
3 | 101122000210200211101112 |
4 | 1213210012331031110 |
5 | 3310220002224340 |
6 | 123030215514152 |
7 | 11014445461661 |
oct | 1474406751524 |
9 | 348023624345 |
10 | 111201211220 |
11 | 43184203960 |
12 | 19675088958 |
13 | a642326788 |
14 | 554c94aa68 |
15 | 2d5c7c2065 |
hex | 19e41bd354 |
111201211220 has 48 divisors (see below), whose sum is σ = 255894363648. Its totient is φ = 40255455360.
The previous prime is 111201211193. The next prime is 111201211241. The reversal of 111201211220 is 22112102111.
It is a junction number, because it is equal to n+sod(n) for n = 111201211195 and 111201211204.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1084259 + ... + 1182378.
It is an arithmetic number, because the mean of its divisors is an integer number (5331132576).
Almost surely, 2111201211220 is an apocalyptic number.
111201211220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111201211220 is an abundant number, since it is smaller than the sum of its proper divisors (144693152428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111201211220 is a wasteful number, since it uses less digits than its factorization.
111201211220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2266880 (or 2266878 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 111201211220 its reverse (22112102111), we get a palindrome (133313313331).
The spelling of 111201211220 in words is "one hundred eleven billion, two hundred one million, two hundred eleven thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •