Base | Representation |
---|---|
bin | 11001010001000001100110… |
… | …111101001110111010100110 |
3 | 112120110002000222220012002200 |
4 | 121101001212331032322212 |
5 | 104031102024012210042 |
6 | 1032200201030115330 |
7 | 32256143654543100 |
oct | 3121014675167246 |
9 | 476402028805080 |
10 | 111121121210022 |
11 | 32452226001960 |
12 | 105680267abb46 |
13 | 4a008a4b20131 |
14 | 1d62410590570 |
15 | cca7ae5a4c4c |
hex | 651066f4eea6 |
111121121210022 has 144 divisors (see below), whose sum is σ = 323503987100112. Its totient is φ = 27164827146240.
The previous prime is 111121121209951. The next prime is 111121121210059. The reversal of 111121121210022 is 220012121121111.
It is a happy number.
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 = 111121121209977 and 111121121210004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 336700483 + ... + 337030350.
It is an arithmetic number, because the mean of its divisors is an integer number (2246555465973).
Almost surely, 2111121121210022 is an apocalyptic number.
111121121210022 is an abundant number, since it is smaller than the sum of its proper divisors (212382865890090).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111121121210022 is a wasteful number, since it uses less digits than its factorization.
111121121210022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 673730883 (or 673730873 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 111121121210022 its reverse (220012121121111), we get a palindrome (331133242331133).
The spelling of 111121121210022 in words is "one hundred eleven trillion, one hundred twenty-one billion, one hundred twenty-one million, two hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •