To determine how many divisors of 21600 are divisible by 10 but not by 15, the prime factorization of 21600 is essential: 21600 = 2^5 × 3^3 × 5^2. A divisor is divisible by 10 if it includes at least one factor of both 2 and 5. However, to ensure the divisor is not divisible by 15, it must exclude the factor of 3. By analyzing the combinations of the remaining factors, particularly focusing on the constraints for n_1, n_2, and n_3, one can apply the fundamental counting principle to find the total number of valid divisors. This approach leads to the solution for the problem posed.