Base | Representation |
---|---|
bin | 1010000001011101001001… |
… | …1101101001010100011110 |
3 | 1110000111212020221022200020 |
4 | 2200113102131221110132 |
5 | 2421023202224213042 |
6 | 35234324010013010 |
7 | 2215114620212016 |
oct | 240272235512436 |
9 | 43014766838606 |
10 | 11020122101022 |
11 | 35696756a5271 |
12 | 129b934717166 |
13 | 61c2681accc8 |
14 | 2a153bb62c46 |
15 | 1419d2ee33ec |
hex | a05d276951e |
11020122101022 has 32 divisors (see below), whose sum is σ = 22308122269440. Its totient is φ = 3628736947200.
The previous prime is 11020122100909. The next prime is 11020122101033. The reversal of 11020122101022 is 22010122102011.
It is a super-2 number, since 2×110201221010222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11020122100992 and 11020122101010.
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, 3628879 + ... + 5933717.
It is an arithmetic number, because the mean of its divisors is an integer number (697128820920).
Almost surely, 211020122101022 is an apocalyptic number.
11020122101022 is an abundant number, since it is smaller than the sum of its proper divisors (11288000168418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11020122101022 is a wasteful number, since it uses less digits than its factorization.
11020122101022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2314528.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11020122101022 its reverse (22010122102011), we get a palindrome (33030244203033).
The spelling of 11020122101022 in words is "eleven trillion, twenty billion, one hundred twenty-two million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •