We prove results on the
asymptotic behavior of Iarge prime factors of the integers. The basic idea of the
paper is that if k is any fixed integer, then the k-th largest prime factor of n,
denoted by Pk(n) is generally much bigger than ∑j>kPj(n). We give precise
estimates of this phenomenon. This paper is a sequel to an earlier paper by the
authors.