Base | Representation |
---|---|
bin | 11001010000110111010000… |
… | …101011101101100011100111 |
3 | 112120102000100122101022111011 |
4 | 121100313100223231203213 |
5 | 104030411300041144233 |
6 | 1032151122312323051 |
7 | 32255301425633131 |
oct | 3120672053554347 |
9 | 476360318338434 |
10 | 111110010099943 |
11 | 32448544084458 |
12 | 10565a456a3487 |
13 | 49cc823b9209a |
14 | 1d61a78a3a051 |
15 | cca35ddb90cd |
hex | 650dd0aed8e7 |
111110010099943 has 2 divisors, whose sum is σ = 111110010099944. Its totient is φ = 111110010099942.
The previous prime is 111110010099929. The next prime is 111110010099997. The reversal of 111110010099943 is 349990010011111.
It is a weak prime.
It is an emirp because it is prime and its reverse (349990010011111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111110010099943 is a prime.
It is a super-3 number, since 3×1111100100999433 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111110010099896 and 111110010099905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111110010099343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55555005049971 + 55555005049972.
It is an arithmetic number, because the mean of its divisors is an integer number (55555005049972).
Almost surely, 2111110010099943 is an apocalyptic number.
111110010099943 is a deficient number, since it is larger than the sum of its proper divisors (1).
111110010099943 is an equidigital number, since it uses as much as digits as its factorization.
111110010099943 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8748, while the sum is 40.
The spelling of 111110010099943 in words is "one hundred eleven trillion, one hundred ten billion, ten million, ninety-nine thousand, nine hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •