Base | Representation |
---|---|
bin | 1010001101000101110000… |
… | …1011100001100100011111 |
3 | 1110201121210011112121212111 |
4 | 2203101130023201210133 |
5 | 2432312030240231421 |
6 | 35510221454414451 |
7 | 2235422041534354 |
oct | 243213413414437 |
9 | 43647704477774 |
10 | 11220001102111 |
11 | 363641513216a |
12 | 1312617801427 |
13 | 635070415699 |
14 | 2ab09db4862b |
15 | 146cd0a15ee1 |
hex | a345c2e191f |
11220001102111 has 8 divisors (see below), whose sum is σ = 11255480793344. Its totient is φ = 11184576039000.
The previous prime is 11220001102099. The next prime is 11220001102151. The reversal of 11220001102111 is 11120110002211.
It is a happy number.
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 11220001102111 - 213 = 11220001093919 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11220001102091 and 11220001102100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11220001102151) 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, 13245585 + ... + 14067178.
It is an arithmetic number, because the mean of its divisors is an integer number (1406935099168).
Almost surely, 211220001102111 is an apocalyptic number.
11220001102111 is a deficient number, since it is larger than the sum of its proper divisors (35479691233).
11220001102111 is an equidigital number, since it uses as much as digits as its factorization.
11220001102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27314061.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11220001102111 its reverse (11120110002211), we get a palindrome (22340111104322).
The spelling of 11220001102111 in words is "eleven trillion, two hundred twenty billion, one million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •