Base | Representation |
---|---|
bin | 11100111101010101111… |
… | …001111100001011011111 |
3 | 21001020120021222200001022 |
4 | 130331111321330023133 |
5 | 230101020321010421 |
6 | 4122110512234355 |
7 | 263526221225063 |
oct | 34752571741337 |
9 | 7036507880038 |
10 | 1990011110111 |
11 | 6a7a60434a92 |
12 | 28181683b9bb |
13 | 115870c66b3b |
14 | 6c461dbdaa3 |
15 | 36b710b67ab |
hex | 1cf55e7c2df |
1990011110111 has 2 divisors, whose sum is σ = 1990011110112. Its totient is φ = 1990011110110.
The previous prime is 1990011110089. The next prime is 1990011110123. The reversal of 1990011110111 is 1110111100991.
It is a strong prime.
It is an emirp because it is prime and its reverse (1110111100991) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1990011110111 - 26 = 1990011110047 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1990011100111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 995005555055 + 995005555056.
It is an arithmetic number, because the mean of its divisors is an integer number (995005555056).
Almost surely, 21990011110111 is an apocalyptic number.
1990011110111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1990011110111 is an equidigital number, since it uses as much as digits as its factorization.
1990011110111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 26.
The spelling of 1990011110111 in words is "one trillion, nine hundred ninety billion, eleven million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •