In number theory, the Golomb–Dickman constant appears in connection with the average size of the largest prime factor of an integer. More precisely,
where is the largest prime factor of k. So if k is a d digit integer, then is the asymptotic average number of digits of the largest prime factor of k.
The Golomb–Dickman constant appears in number theory in a different way. What is the probability that second largest prime factor of n is smaller than the square root of the largest prime factor of n? Asymptotically, this probability is . More precisely,
where is the second largest prime factor n.
There are several expressions for . Namely,
where is the exponential integral,
where is the Dickman function.