def is_strong_harshad(n):
""" Determine if n / (sum of digits of n) is prime
:param n:
:return:
"""
sum_digits = euler.sum_digits(n)
return n % sum_digits == 0 and euler.is_prime(n / sum_digits)
def is_harshad(n):
return n % euler.sum_digits(n) == 0
