Base | Representation |
---|---|
bin | 11001010000110111010000… |
… | …101011010101011011110011 |
3 | 112120102000100122012021221202 |
4 | 121100313100223111123303 |
5 | 104030411300030014024 |
6 | 1032151122310241415 |
7 | 32255301425042102 |
oct | 3120672053253363 |
9 | 476360318167852 |
10 | 111110010001139 |
11 | 324485440171a6 |
12 | 10565a4565626b |
13 | 49cc823b59116 |
14 | 1d61a78a12039 |
15 | cca35dd99bae |
hex | 650dd0ad56f3 |
111110010001139 has 2 divisors, whose sum is σ = 111110010001140. Its totient is φ = 111110010001138.
The previous prime is 111110010001103. The next prime is 111110010001169. The reversal of 111110010001139 is 931100010011111.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111110010001139 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111110010001139.
It is not a weakly prime, because it can be changed into another prime (111110010001169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55555005000569 + 55555005000570.
It is an arithmetic number, because the mean of its divisors is an integer number (55555005000570).
Almost surely, 2111110010001139 is an apocalyptic number.
111110010001139 is a deficient number, since it is larger than the sum of its proper divisors (1).
111110010001139 is an equidigital number, since it uses as much as digits as its factorization.
111110010001139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 20.
The spelling of 111110010001139 in words is "one hundred eleven trillion, one hundred ten billion, ten million, one thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •