Suppose, a very large composite number $N$ (let's say $1\ 000$ digits) has no prime factor below some moderate limit (lets say $10^{19}$).
How can I calculate approximately the expected number of digits of the second-largest prime factor of $N$ ?
I tried to use the asymptotic formula for the number of $y$-rough numbers below $x$, but this lead to nowhere.