Determine the respective minimum values of a positive integer N for each p = 1 to 9 inclusively, such that:

- N is composite, and:
- All positive divisors of N (including itself but, with the exclusion of 1) contain the digit p.

All minimum N's have to be the product of two primes, each of which has p in it.

For p = 7, I think the first 4 are:

497 = 7*71

679 = 7*97

749 = 7*107

799 = 17*47

*Edited on ***May 25, 2014, 4:10 pm**