Base | Representation |
---|---|
bin | 1010000111011000101101… |
… | …1101111001101110111110 |
3 | 1110101020212000101002012120 |
4 | 2201312023131321232332 |
5 | 2424210334102413042 |
6 | 35353214141343410 |
7 | 2225352531605160 |
oct | 241661335715676 |
9 | 43336760332176 |
10 | 11122010201022 |
11 | 35a88aa898896 |
12 | 12b762a867b66 |
13 | 628a54c17986 |
14 | 2a6445870930 |
15 | 144497d89dec |
hex | a1d8b779bbe |
11122010201022 has 32 divisors (see below), whose sum is σ = 26527030543872. Its totient is φ = 3039555582624.
The previous prime is 11122010201011. The next prime is 11122010201041. The reversal of 11122010201022 is 22010201022111.
It is a super-2 number, since 2×111220102010222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11122010200992 and 11122010201010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5756733093 + ... + 5756735024.
It is an arithmetic number, because the mean of its divisors is an integer number (828969704496).
Almost surely, 211122010201022 is an apocalyptic number.
11122010201022 is an abundant number, since it is smaller than the sum of its proper divisors (15405020342850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11122010201022 is a wasteful number, since it uses less digits than its factorization.
11122010201022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11513468152.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11122010201022 its reverse (22010201022111), we get a palindrome (33132211223133).
It can be divided in two parts, 111 and 22010201022, that multiplied together give a palindrome (2443132313442).
The spelling of 11122010201022 in words is "eleven trillion, one hundred twenty-two billion, ten million, two hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •