Base | Representation |
---|---|
bin | 1010000001100100111110… |
… | …1000100010110101000110 |
3 | 1110000201021121110211110100 |
4 | 2200121033220202311012 |
5 | 2421042002330010042 |
6 | 35235312224304530 |
7 | 2215220640044154 |
oct | 240311750426506 |
9 | 43021247424410 |
10 | 11022222110022 |
11 | 356a55303a0a2 |
12 | 12a021ba72146 |
13 | 61c5112a1c96 |
14 | 2a169aa123d4 |
15 | 141aa755d24c |
hex | a064fa22d46 |
11022222110022 has 24 divisors (see below), whose sum is σ = 23885728564464. Its totient is φ = 3673420601904.
The previous prime is 11022222109993. The next prime is 11022222110057. The reversal of 11022222110022 is 22001122222011.
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 = 11022222109977 and 11022222110004.
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 11 ways as a sum of consecutive naturals, for example, 54348873 + ... + 54551300.
It is an arithmetic number, because the mean of its divisors is an integer number (995238690186).
Almost surely, 211022222110022 is an apocalyptic number.
11022222110022 is an abundant number, since it is smaller than the sum of its proper divisors (12863506454442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11022222110022 is a wasteful number, since it uses less digits than its factorization.
11022222110022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108905804 (or 108905801 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 11022222110022 its reverse (22001122222011), we get a palindrome (33023344332033).
The spelling of 11022222110022 in words is "eleven trillion, twenty-two billion, two hundred twenty-two million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •