Base | Representation |
---|---|
bin | 1010001011111111011000… |
… | …1100011101001100010111 |
3 | 1110122211000121222102102111 |
4 | 2202333312030131030113 |
5 | 2432004333202413421 |
6 | 35453415145051451 |
7 | 2234152644531265 |
oct | 242776614351427 |
9 | 43584017872374 |
10 | 11201110201111 |
11 | 3629400772696 |
12 | 130aa25186b87 |
13 | 63334c75615c |
14 | 2aa1cac8d435 |
15 | 14657732bee1 |
hex | a2ff631d317 |
11201110201111 has 8 divisors (see below), whose sum is σ = 11327201375760. Its totient is φ = 11075024271168.
The previous prime is 11201110201109. The next prime is 11201110201147. The reversal of 11201110201111 is 11110201110211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11201110201111 - 21 = 11201110201109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11201110201091 and 11201110201100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11201110201711) 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, 3066045 + ... + 5639401.
It is an arithmetic number, because the mean of its divisors is an integer number (1415900171970).
Almost surely, 211201110201111 is an apocalyptic number.
11201110201111 is a deficient number, since it is larger than the sum of its proper divisors (126091174649).
11201110201111 is an equidigital number, since it uses as much as digits as its factorization.
11201110201111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2622353.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11201110201111 its reverse (11110201110211), we get a palindrome (22311311311322).
The spelling of 11201110201111 in words is "eleven trillion, two hundred one billion, one hundred ten million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •