Base | Representation |
---|---|
bin | 1010000001100100100110… |
… | …0111001110011110100110 |
3 | 1110000201000120102001102200 |
4 | 2200121021213032132212 |
5 | 2421041301000214342 |
6 | 35235254215315330 |
7 | 2215215302350650 |
oct | 240311147163646 |
9 | 43021016361380 |
10 | 11022121101222 |
11 | 356a501019750 |
12 | 12a01b207bb46 |
13 | 61c4c639726a |
14 | 2a168b43b6d0 |
15 | 141a9d75994c |
hex | a06499ce7a6 |
11022121101222 has 48 divisors (see below), whose sum is σ = 29774041420032. Its totient is φ = 2862888597360.
The previous prime is 11022121101163. The next prime is 11022121101247. The reversal of 11022121101222 is 22210112122011.
11022121101222 is a `hidden beast` number, since 1 + 10 + 221 + 211 + 0 + 1 + 222 = 666.
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 = 11022121101195 and 11022121101204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3976232778 + ... + 3976235549.
It is an arithmetic number, because the mean of its divisors is an integer number (620292529584).
Almost surely, 211022121101222 is an apocalyptic number.
11022121101222 is an abundant number, since it is smaller than the sum of its proper divisors (18751920318810).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11022121101222 is a wasteful number, since it uses less digits than its factorization.
11022121101222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7952468353 (or 7952468350 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 11022121101222 its reverse (22210112122011), we get a palindrome (33232233223233).
The spelling of 11022121101222 in words is "eleven trillion, twenty-two billion, one hundred twenty-one million, one hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •