Base | Representation |
---|---|
bin | 1010000110101100101110… |
… | …0101110000101100111111 |
3 | 1110100010101000110122120002 |
4 | 2201223023211300230333 |
5 | 2424012142440213434 |
6 | 35343542251344515 |
7 | 2224454066115401 |
oct | 241531345605477 |
9 | 43303330418502 |
10 | 11110201101119 |
11 | 35a389a97429a |
12 | 12b5293a5213b |
13 | 6278c24a24b3 |
14 | 2a5a45346b71 |
15 | 14400627757e |
hex | a1acb970b3f |
11110201101119 has 2 divisors, whose sum is σ = 11110201101120. Its totient is φ = 11110201101118.
The previous prime is 11110201101107. The next prime is 11110201101127. The reversal of 11110201101119 is 91110110201111.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (91110110201111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11110201101119 is a prime.
It is a super-2 number, since 2×111102011011192 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11110201101119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11110201101319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555100550559 + 5555100550560.
It is an arithmetic number, because the mean of its divisors is an integer number (5555100550560).
Almost surely, 211110201101119 is an apocalyptic number.
11110201101119 is a deficient number, since it is larger than the sum of its proper divisors (1).
11110201101119 is an equidigital number, since it uses as much as digits as its factorization.
11110201101119 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 20.
The spelling of 11110201101119 in words is "eleven trillion, one hundred ten billion, two hundred one million, one hundred one thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •