I have a number, n, for which it is true that whenever a semiprime is 2 greater than a prime, they are either both factors of n, or neither are. A semiprime is a number with exactly two prime factors, for example 4 (2x2) or 6 (2x3).
So for instance, 33 is a semiprime (3x11) which is 2 greater than a prime (31), and so EITHER 33 and 31 both divide into n, OR neither do.
My number only has one pair of repeated prime factors: a pair of 3s. All its other prime factors are unique.
n is the smallest possible number to satisfy the above rules. What is n?
For an extra challenge, what is the next smallest number that satisfies the rules?
Quisque iaculis facilisis lacinia. Mauris euismod pellentesque tellus sit amet mollis.