Base | Representation |
---|---|
bin | 11001010000101110111110… |
… | …010000111010101000100011 |
3 | 112120101011101110102212122201 |
4 | 121100232332100322220203 |
5 | 104030240033423314024 |
6 | 1032143051301114031 |
7 | 32254535051053024 |
oct | 3120567620725043 |
9 | 476334343385581 |
10 | 111101111151139 |
11 | 3244479793250a |
12 | 105641813b8917 |
13 | 49cba36332bc5 |
14 | 1d61472c0ac4b |
15 | cc9edc9ed744 |
hex | 650bbe43aa23 |
111101111151139 has 2 divisors, whose sum is σ = 111101111151140. Its totient is φ = 111101111151138.
The previous prime is 111101111151101. The next prime is 111101111151161. The reversal of 111101111151139 is 931151111101111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111101111151139 - 243 = 102305018128931 is a prime.
It is not a weakly prime, because it can be changed into another prime (111101111151539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55550555575569 + 55550555575570.
It is an arithmetic number, because the mean of its divisors is an integer number (55550555575570).
Almost surely, 2111101111151139 is an apocalyptic number.
111101111151139 is a deficient number, since it is larger than the sum of its proper divisors (1).
111101111151139 is an equidigital number, since it uses as much as digits as its factorization.
111101111151139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135, while the sum is 28.
The spelling of 111101111151139 in words is "one hundred eleven trillion, one hundred one billion, one hundred eleven million, one hundred fifty-one thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •