Base | Representation |
---|---|
bin | 1010001011111111010110… |
… | …1010001100100101110011 |
3 | 1110122211000000002010221120 |
4 | 2202333311222030211303 |
5 | 2432004323403021321 |
6 | 35453414224353323 |
7 | 2234152505305020 |
oct | 242776552144563 |
9 | 43584000063846 |
10 | 11201101220211 |
11 | 36293a6699161 |
12 | 130aa22175843 |
13 | 63334a930406 |
14 | 2aa1c99d2547 |
15 | 146576655ec6 |
hex | a2ff5a8c973 |
11201101220211 has 16 divisors (see below), whose sum is σ = 17966678649600. Its totient is φ = 6063754043808.
The previous prime is 11201101220069. The next prime is 11201101220213. The reversal of 11201101220211 is 11202210110211.
It is a happy number.
It is not a de Polignac number, because 11201101220211 - 214 = 11201101203827 is a prime.
It is a super-2 number, since 2×112011012202112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11201101220213) 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, 14036467296 + ... + 14036468093.
It is an arithmetic number, because the mean of its divisors is an integer number (1122917415600).
Almost surely, 211201101220211 is an apocalyptic number.
11201101220211 is a deficient number, since it is larger than the sum of its proper divisors (6765577429389).
11201101220211 is a wasteful number, since it uses less digits than its factorization.
11201101220211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28072935418.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11201101220211 its reverse (11202210110211), we get a palindrome (22403311330422).
Subtracting 11201101220211 from its reverse (11202210110211), we obtain a square (1108890000 = 333002).
The spelling of 11201101220211 in words is "eleven trillion, two hundred one billion, one hundred one million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •