Generating all multiplicative partitions of $n$ in time $2^{o(\log n)}$

Question

Is it possible to generate all multiplicative partitions of $n$ in time $2^{o(\log n)}$?

$o(\cdot)$ is "small O" notation.