How many ways are there to choose distinct positive integers $a, b, c, d$ dividing $15^6$ such that none of $a, b, c,$ or $d$ divide each other? (Order does not matter.)

Let's think step by step and output the final answer within \boxed{}.
user