Erdős problem 1189

For irreducible covering sets of size $k$, determine their count, the possible largest modulus, the maximal reciprocal sum, and whether divisor-set examples occur infinitely often.