← RoseCode

ROSECODE 161

Quasi-perfect numbers (revisited)

gerrob · Programming ·

See Quasi-perfect numbers problem from Philippe. This time find the first decomposition in lexicographic order for N=30380400.

Answer format: P%98961651023
(where P is the product of all terms in the decomposition)

Example: 3375000 (for N=150)

[My timing: 24 seconds]