Base | Representation |
---|---|
bin | 1010000111011000110000… |
… | …1010111111110001001110 |
3 | 1110101020212211121122211210 |
4 | 2201312030022333301032 |
5 | 2424210400114202342 |
6 | 35353215242555250 |
7 | 2225353034231256 |
oct | 241661412776116 |
9 | 43336784548753 |
10 | 11122022022222 |
11 | 35a8906532281 |
12 | 12b7632808b26 |
13 | 628a574c6477 |
14 | 2a644726a966 |
15 | 144498e2279c |
hex | a1d8c2bfc4e |
11122022022222 has 16 divisors (see below), whose sum is σ = 22247167854672. Its totient is φ = 3706820039040.
The previous prime is 11122022022203. The next prime is 11122022022229. The reversal of 11122022022222 is 22222022022111.
It is a super-3 number, since 3×111220220222223 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11122022022229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 130112473 + ... + 130197924.
It is an arithmetic number, because the mean of its divisors is an integer number (1390447990917).
Almost surely, 211122022022222 is an apocalyptic number.
11122022022222 is an abundant number, since it is smaller than the sum of its proper divisors (11125145832450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11122022022222 is a wasteful number, since it uses less digits than its factorization.
11122022022222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 260317523.
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 11122022022222 its reverse (22222022022111), we get a palindrome (33344044044333).
The spelling of 11122022022222 in words is "eleven trillion, one hundred twenty-two billion, twenty-two million, twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •