Estimate for the product of primes less than n In this paper Erdős shows a shorter proof for one of his old results stating that $$ s(n) = \prod_{p < n} p < 4^n$$ where the product is taken over all primes less than $n$. He also remarks that using the prime number theorem one can show $$ s(n)^{\frac1n} \stackrel{n\to\infty}{\longrightarrow} e.$$
Can someone here prove this result? It does not seem straightforward to me. 
One (crude) attempt I tried was to consider the product $$\prod_{i=2}^n \frac{i}{\log{i}} = n!\prod_{i=2}^n \frac{1}{\log{i}}$$ which I do not know how to estimate, not to mention that I would then have to argue that it is an asymptotic estimate for $s(n).$ 
Is there a simple way to show the result about $s(n)$ using the prime number theorem?

The reason the sum
$$ \sum_{k = 2}^{n} \frac{k}{\log k} $$
works as an estimate of the sum of all primes up to $n$ is because, roughly speaking, one on $\log N$ numbers of size around $N$ are prime. You are estimating

The sum of all primes of a given size

with the approximation

The sum of all numbers of that size, multiplied by (an estimate of) the proportion of them that are primes

(note that this method relies on the fact that the average of the primes of size around $N$ is roughly the same as the average of all numbers of size around $N$... specifically, that average is around $N$)
The analogous method for products is not dividing out by $\log i$: it is taking the $\log i$-th root: you meant to consider
$$ \prod_{k=2}^{n} k^{1 / \log k} $$
Of course, this isn't necessarily any easier to deal with. The thing to do is the one that is usually useful for products: take the logarithm. Consider
$$ \log \prod_{\substack{p=2 \\ p \text{ prime}}}^N p$$
