Problem #WSP-5319

Problems Number Theory Divisibility

Problem

For an odd number N denote by A the minimal positive difference between prime divisors of N, denote by B the minimal positive difference between composite divisors of N. Usually we have A<B, but can we have A>B? (Disregard numbers such as 15 where one of A or B is not defined)