The three-digit number abc has 3 distinct digits. Find all possible numbers of the form abc which satisfy abc = c (a+b+c)^2. Computationally I found 6 solutions, but is there any "analytical" (number theory, modular arithmetic) approach?
Thanks in advance.