I don't see any short cut to doing this, other than to find the least common multiple and to sum its digits.

The least common multiple of two numbers is equal to the product of the numbers, divided by their greatest common divisor. To find the greatest common divisor, use Euclid's algorithm.