Base | Representation |
---|---|
bin | 11001010000101110111110… |
… | …001100100001110110001111 |
3 | 112120101011101101021110000102 |
4 | 121100232332030201312033 |
5 | 104030240033130013124 |
6 | 1032143051220321315 |
7 | 32254535035222664 |
oct | 3120567614416617 |
9 | 476334341243012 |
10 | 111101110001039 |
11 | 32444797217414 |
12 | 10564180b4323b |
13 | 49cba3601c582 |
14 | 1d614729cba6b |
15 | cc9edc872aae |
hex | 650bbe321d8f |
111101110001039 has 2 divisors, whose sum is σ = 111101110001040. Its totient is φ = 111101110001038.
The previous prime is 111101110001003. The next prime is 111101110001107. The reversal of 111101110001039 is 930100011101111.
It is a weak prime.
It is an emirp because it is prime and its reverse (930100011101111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111101110001039 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111101110001039.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111101110001339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55550555000519 + 55550555000520.
It is an arithmetic number, because the mean of its divisors is an integer number (55550555000520).
Almost surely, 2111101110001039 is an apocalyptic number.
111101110001039 is a deficient number, since it is larger than the sum of its proper divisors (1).
111101110001039 is an equidigital number, since it uses as much as digits as its factorization.
111101110001039 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 111101110001039 in words is "one hundred eleven trillion, one hundred one billion, one hundred ten million, one thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •