Base | Representation |
---|---|
bin | 1010001101000110100100… |
… | …1110111110100100010010 |
3 | 1110201122100102122102202100 |
4 | 2203101221032332210102 |
5 | 2432313002322023442 |
6 | 35510255320501230 |
7 | 2235430341222531 |
oct | 243215116764422 |
9 | 43648312572670 |
10 | 11220220111122 |
11 | 3636517818950 |
12 | 131267901a816 |
13 | 6350a68c7009 |
14 | 2ab0c0c78318 |
15 | 146ce4d7784c |
hex | a34693be912 |
11220220111122 has 24 divisors (see below), whose sum is σ = 26520520263120. Its totient is φ = 3400066700280.
The previous prime is 11220220111117. The next prime is 11220220111123. The reversal of 11220220111122 is 22111102202211.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 11220220111095 and 11220220111104.
It is not an unprimeable number, because it can be changed into a prime (11220220111123) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 28333888972 + ... + 28333889367.
It is an arithmetic number, because the mean of its divisors is an integer number (1105021677630).
Almost surely, 211220220111122 is an apocalyptic number.
11220220111122 is an abundant number, since it is smaller than the sum of its proper divisors (15300300151998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11220220111122 is a wasteful number, since it uses less digits than its factorization.
11220220111122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56667778358 (or 56667778355 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 11220220111122 its reverse (22111102202211), we get a palindrome (33331322313333).
The spelling of 11220220111122 in words is "eleven trillion, two hundred twenty billion, two hundred twenty million, one hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •