Egyptian equation II

Let the diophantine equation $\frac{1}{x}+\frac{1}{y}=\frac{1}{n}$ with $x\le y$

How many solutions are there for $n=1000000!$ ?

As the answer is a BIG number, use the following condensed representation:
(First 10 digits)[(number of remaining digits](Last 10 digits]

For instance, for 2^127, the representation is: 1701411834[19]5884105728


Example: $8583170787[2]5400804688\text{ for }n=100!$

[My timing: < 1 sec]