1.

#TO CHECK WHETHER A NO. IS PERFECT NO. OR NOT

n=int(input('ENTER A NO: '))
print('THE FACTORS ARE ',end='')
per=0
for i in range(1,n+1):
x=n%i
if x==0:
y=n//i
print(y,end=',')
if y==n: continue
per=per+y
print()
print('THE SUM OF THE FACTORS EXCLUDING',n,'IS',per)
if per==n:
print('HENCE THE GN NO. IS A PERFECT NO')
else:
print('HENCE THE GN. NO. IS NOT A PERFECT NO')
#program is over

INPUT:
ENTER A NO: 28
OUTPUT:
THE FACTORS ARE 28,14,7,4,2,1,
THE SUM OF THE FACTORS EXCLUDING 28 IS 28
HENCE THE GN NO. IS A PERFECT NO
-----------------------------------------------------------------------------------
-------------------------------
2.
#TO CHECK WHETHER ARMSTRONG NO. OR NOT
n=int(input('enter any number'))
count=0
n1=n
#finding the order of no.
while n!=0:
n=int(n/10)
count+=1
print('THE NO. OF DIGITS IS',count)
#finding the result by multiplying each digit with order no. of times.
n=n1
result=0
while n!=0:
rem=n%10
mul=rem**count
result=result+mul
n=int(n/10)
print('THE SUM OF THE DIGITS MULTIPLIED BY ITS ORDER IS',result)
#check armstrong or not
if result==n1:
print(result,'=',n1)
print('THE GN NO. IS AN ARMSTRONG NO')
else:
print(result,'is not =',n1)
print('THE GN NO. IS NOT AN ARMSTRONG NO')
#program is over

INPUT:
ENTER ANY NUMBER: 456
OUTPUT:
THE NO. OF DIGITS IS 3
THE SUM OF THE DIGITS MULTIPLIED BY ITS ORDER IS 405
405 is not = 456
THE GN NO. IS NOT AN ARMSTRONG NO
-----------------------------------------------------------------------------------
---------------------------
3.
#PROGRAM TO CHECK WHETHER A NO. IS PALINDROME OR NOT
n=int(input('ENTER ANY NO. '))
n1=n
rev=0
#to find the reverse of gn no.
while n!=0:
rem=n%10
rev=rev*10+rem
n=n//10
#checking palindrome or not
if n1==rev:
print('THE GN NO. IS PALINDROME!')
else:
print('NOT A PALINDROME!')
#program is over

INPUT:
ENTER ANY NO: 656
OUTPUT:
THE GN NO. IS PALINDROME!
-----------------------------------------------------------------------------------
-------------------------------------------------------
4.
#TO CHECK WHETHER A NO. IS PRIME OR COMPOSITE
n=int(input('ENTER A NO: '))
print('THE FACTORS ARE ',end='')
count_factor=0
#finding the factors of gn no.
for i in range(1,n+1):
x=n%i
if x==0:
y=n//i
print(y,end=',')
count_factor+=1
#checking prime or composite
if count_factor==2:
print('\nTHERE ARE ONLY 2 FACTORS 1 AND NUMBER ITSELF. HENCE THE GN NO. IS
PRIME.')
else:
print('\nTHERE ARE MORE THAN 2 FACTORS FOR THE GN NO. HENCE THE GN NO. IS
COMPOSITE.')
#program is over

INPUT:
ENTER A NO: 72
OUTPUT:
THE FACTORS ARE 72,36,24,18,12,9,8,6,4,3,2,1,
THERE ARE MORE THAN 2 FACTORS FOR THE GN NO. HENCE THE GN NO. IS COMPOSITE
-----------------------------------------------------------------------------------
-------------------------------------------------------------
5.
#PROGRAM TO DISPLAY THE TERMS OF FIBONACCI SERIES
a=0
b=1
n=int(input('ENTER THE NO. OF TERMS: '))
if n==1:
print('THERE IS ONLY ONE TERM,',a)
elif n==2:
print('THE TWO TERMS ARE',a,b)
else:
print('THE TERMS OF FIBANACI SERIES ARE',a,b,end=' ')
for i in range(3,n+1):
c=a+b
print(c,end=' ')
a,b=b,c
#program over

INPUT:
ENTER THE NO. OF TERMS: 15
OUTPUT:
THE TERMS OF FIBANACI SERIES ARE 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377