Base | Representation |
---|---|
bin | 1010001101000110001101… |
… | …0100111110101001010011 |
3 | 1110201122002112012010200020 |
4 | 2203101203110332221103 |
5 | 2432312301440133021 |
6 | 35510241420554523 |
7 | 2235425026040220 |
oct | 243214324765123 |
9 | 43648075163606 |
10 | 11220121021011 |
11 | 3636476898aa1 |
12 | 131264b9b2a43 |
13 | 63508c211706 |
14 | 2ab0b1a42947 |
15 | 146cdb3027c6 |
hex | a346353ea53 |
11220121021011 has 32 divisors (see below), whose sum is σ = 18409883834880. Its totient is φ = 5932073657856.
The previous prime is 11220121021001. The next prime is 11220121021049. The reversal of 11220121021011 is 11012012102211.
It is a happy number.
11220121021011 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 11220121021011 - 29 = 11220121020499 is a prime.
It is a super-2 number, since 2×112201210210112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11220121021001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 266325636 + ... + 266367761.
It is an arithmetic number, because the mean of its divisors is an integer number (575308869840).
Almost surely, 211220121021011 is an apocalyptic number.
11220121021011 is a deficient number, since it is larger than the sum of its proper divisors (7189762813869).
11220121021011 is a wasteful number, since it uses less digits than its factorization.
11220121021011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 532693483.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11220121021011 its reverse (11012012102211), we get a palindrome (22232133123222).
The spelling of 11220121021011 in words is "eleven trillion, two hundred twenty billion, one hundred twenty-one million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •