Base | Representation |
---|---|
bin | 1010000001100100111110… |
… | …0000111101001110110011 |
3 | 1110000201021110201210001021 |
4 | 2200121033200331032303 |
5 | 2421042001322333021 |
6 | 35235312113520311 |
7 | 2215220614121251 |
oct | 240311740751663 |
9 | 43021243653037 |
10 | 11022220121011 |
11 | 356a551a00790 |
12 | 12a021b273097 |
13 | 61c510a56858 |
14 | 2a169a6555d1 |
15 | 141aa72b8c41 |
hex | a064f83d3b3 |
11022220121011 has 16 divisors (see below), whose sum is σ = 12159584892000. Its totient is φ = 9907417273600.
The previous prime is 11022220120999. The next prime is 11022220121021. The reversal of 11022220121011 is 11012102222011.
11022220121011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11022220121011 - 27 = 11022220120883 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11022220121021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 75448065 + ... + 75594013.
It is an arithmetic number, because the mean of its divisors is an integer number (759974055750).
Almost surely, 211022220121011 is an apocalyptic number.
11022220121011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11022220121011 is a deficient number, since it is larger than the sum of its proper divisors (1137364770989).
11022220121011 is a wasteful number, since it uses less digits than its factorization.
11022220121011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 223190.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11022220121011 its reverse (11012102222011), we get a palindrome (22034322343022).
The spelling of 11022220121011 in words is "eleven trillion, twenty-two billion, two hundred twenty million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •