Codewars_1.py

#7 kyu: https://www.codewars.com/kata/570523c146edc287a50014b1
#Especially Joyful Numbers
#Positive integers that are divisible exactly by the sum of their digits are called Harshad numbers. 
#The first few Harshad numbers are: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 18, ...
#We are interested in Harshad numbers where the product of its digit sum s and s with the digits reversed, gives the original number n. 
#For example consider number 1729:
#its digit sum, s = 1 + 7 + 2 + 9 = 19
#reversing s = 91
#and 19 * 91 = 1729 --> the number that we started with.
#Complete the function which tests if a positive integer n is Harshad number, and returns True if the product of its digit sum and its digit sum 
#reversed equals n; otherwise return False.
for a given number to check:
    a=1729
[print("True") if sum(list(map(int,list(str(a)))))*int(str(sum(list(map(int,list(str(a))))))[::-1])==a else print("False")]
for a list of numbers to check:
    a=[1729,1729, 1824]
[print("True") if sum(list(map(int,list(str(i)))))*int(str(sum(list(map(int,list(str(i))))))[::-1])==i else print("False") for i in a]