On arithmetic properties of integers with missing digits II: Prime factors Original Research Article

Prime factors of numbers with missing digits are studied. It is shown that, under certain conditions, this set satisfies an Erdős-Kac type theorem; it contains numbers with ‘many’ prime factors; it contains numbers whose greatest prime factor is ‘large’ (resp. ‘small’).