I did a very long calculation by assume a=1, b=1 ; a=1,c=1 ; b=1,c=1, from here, I know 1575x35 = 2625x21 = 3675x15. Then I calculate each possible answer, I got 36 divisors. But is there any faster way? I really have no idea. :(
If the prime factorization of [tex]n[/tex] is [tex]n=p_1^{e_1}p_2^{e_2}...p_n^{e_n}[/tex]. Now, in any divisor, each prime factor's exponent [tex]a[/tex] range from [tex]0\leq a \leq e_i[/tex].