Base | Representation |
---|---|
bin | 1010001011111111011000… |
… | …1011101111000011001111 |
3 | 1110122211000121121211011111 |
4 | 2202333312023233003033 |
5 | 2432004333130341421 |
6 | 35453415141032451 |
7 | 2234152643113255 |
oct | 242776613570317 |
9 | 43584017554144 |
10 | 11201110012111 |
11 | 3629400653698 |
12 | 130aa250b5727 |
13 | 63334c6bb116 |
14 | 2aa1cac405d5 |
15 | 1465772e0ee1 |
hex | a2ff62ef0cf |
11201110012111 has 4 divisors (see below), whose sum is σ = 11286614668824. Its totient is φ = 11115605355400.
The previous prime is 11201110012109. The next prime is 11201110012153. The reversal of 11201110012111 is 11121001110211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11201110012111 - 21 = 11201110012109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11201110012091 and 11201110012100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11201110012171) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42752328160 + ... + 42752328421.
It is an arithmetic number, because the mean of its divisors is an integer number (2821653667206).
Almost surely, 211201110012111 is an apocalyptic number.
11201110012111 is a deficient number, since it is larger than the sum of its proper divisors (85504656713).
11201110012111 is an equidigital number, since it uses as much as digits as its factorization.
11201110012111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85504656712.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11201110012111 its reverse (11121001110211), we get a palindrome (22322111122322).
The spelling of 11201110012111 in words is "eleven trillion, two hundred one billion, one hundred ten million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •