programs
Divisors n=int(input("enter a number")) for i in range(1,n+1,1): if(n%i==0): print(i) Perfect number n=int(input("enetr a number: ")) sum=0 t=n for i in range(1,n,1): if(n%i==0): #print(i) sum=sum+i print(sum) if(sum==t): print("perfect") else: print("not perfect") count the digits n=int(input("enetr a number: ")) count=0 while (n>0): digit=n%10 if(digit>=0): count=count+1 n=n//10 print(count) Reverse number n=int(input("enetr a number: ")) reverse=0 while (n>0): digit=n%10 reverse=reverse*10+digit n=n//10 print(reverse) Palindrom or not n=int(input("enetr a number: ")) T=n reverse=0 while (n>0): digit=n%10 reverse=reverse*10+digit n=n//10 if(T==reverse...