Base | Representation |
---|---|
bin | 110011101100011000… |
… | …1110100101101100100 |
3 | 101121112120000022000210 |
4 | 1213120301310231210 |
5 | 3304322321401040 |
6 | 122555305335420 |
7 | 11006646653031 |
oct | 1473061645544 |
9 | 347476008023 |
10 | 111011122020 |
11 | 43096980047 |
12 | 19621497570 |
13 | a611b2c566 |
14 | 55315c8388 |
15 | 2d4ac74480 |
hex | 19d8c74b64 |
111011122020 has 48 divisors (see below), whose sum is σ = 313908694848. Its totient is φ = 29309865600.
The previous prime is 111011122007. The next prime is 111011122037. The reversal of 111011122020 is 20221110111.
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 = 111011121987 and 111011122005.
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, 9153274 + ... + 9165393.
It is an arithmetic number, because the mean of its divisors is an integer number (6539764476).
Almost surely, 2111011122020 is an apocalyptic number.
111011122020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111011122020 is an abundant number, since it is smaller than the sum of its proper divisors (202897572828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111011122020 is a wasteful number, since it uses less digits than its factorization.
111011122020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18318780 (or 18318778 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 111011122020 its reverse (20221110111), we get a palindrome (131232232131).
The spelling of 111011122020 in words is "one hundred eleven billion, eleven million, one hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •