Given an arithmetic function , we consider the set
where and denote primes. Depending on the choice of , the possible sets include the set of prime powers, almost primes, friable numbers, dense numbers, and practical numbers.
We will discuss (1) asymptotic results for the counting function of , (2) a generalization of the Siegel-Walfisz theorem, and (3) the normal order of the number of prime factors of integers in .