Base | Representation |
---|---|
bin | 11001010000110111010000… |
… | …101011010111110111111011 |
3 | 112120102000100122012210122211 |
4 | 121100313100223113313323 |
5 | 104030411300030324011 |
6 | 1032151122310355551 |
7 | 32255301425113165 |
oct | 3120672053276773 |
9 | 476360318183584 |
10 | 111110010011131 |
11 | 3244854402375a |
12 | 10565a4565bbb7 |
13 | 49cc823b60831 |
14 | 1d61a78a15935 |
15 | cca35dd9cb21 |
hex | 650dd0ad7dfb |
111110010011131 has 2 divisors, whose sum is σ = 111110010011132. Its totient is φ = 111110010011130.
The previous prime is 111110010011089. The next prime is 111110010011159. The reversal of 111110010011131 is 131110010011111.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111110010011131 - 211 = 111110010009083 is a prime.
It is a super-2 number, since 2×1111100100111312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (111110010071131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55555005005565 + 55555005005566.
It is an arithmetic number, because the mean of its divisors is an integer number (55555005005566).
Almost surely, 2111110010011131 is an apocalyptic number.
111110010011131 is a deficient number, since it is larger than the sum of its proper divisors (1).
111110010011131 is an equidigital number, since it uses as much as digits as its factorization.
111110010011131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 13.
Adding to 111110010011131 its reverse (131110010011111), we get a palindrome (242220020022242).
The spelling of 111110010011131 in words is "one hundred eleven trillion, one hundred ten billion, ten million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •