Base | Representation |
---|---|
bin | 1010001011111111000011… |
… | …1100011000011001110111 |
3 | 1110122210210111012110221112 |
4 | 2202333300330120121313 |
5 | 2432004143124213421 |
6 | 35453402320505235 |
7 | 2234150524641053 |
oct | 242776074303167 |
9 | 43583714173845 |
10 | 11201022101111 |
11 | 3629365a69877 |
12 | 130a9bb77b21b |
13 | 63333741ac8b |
14 | 2aa1bd2b8c63 |
15 | 14656e72845b |
hex | a2ff0f18677 |
11201022101111 has 8 divisors (see below), whose sum is σ = 11203831612800. Its totient is φ = 11198212906552.
The previous prime is 11201022101077. The next prime is 11201022101189. The reversal of 11201022101111 is 11110122010211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11201022101111 is a prime.
It is a super-2 number, since 2×112010221011112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11201022101611) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 80558096 + ... + 80697018.
It is an arithmetic number, because the mean of its divisors is an integer number (1400478951600).
Almost surely, 211201022101111 is an apocalyptic number.
11201022101111 is a deficient number, since it is larger than the sum of its proper divisors (2809511689).
11201022101111 is a wasteful number, since it uses less digits than its factorization.
11201022101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158565.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11201022101111 its reverse (11110122010211), we get a palindrome (22311144111322).
The spelling of 11201022101111 in words is "eleven trillion, two hundred one billion, twenty-two million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.264 sec. • engine limits •