23) To confirm given number is double digit number
n = int(input("Enter a positive number: "))
count = 0
while n > 0:
count += 1
n= n // 10
if count == 2:
print("It is a double-digit number.")
else:
print("It is not a double-digit number.")
Output:
Enter a positive number: 12
It is a double-digit number.
n = int(input("Enter a number: "))
if 10 <= n <= 99:
print("It is a double-digit number.")
else:
print("It is not a double-digit number.")
Output:
Enter a number: 123
It is not a double-digit number.
24)Neon Number
A neon number is a number where the sum of digits of square of the number is equal to the number (9*9=81,8+1=9)
def neon(n):
square = n * n
sum = 0
while square > 0:
sum = sum+square % 10
square=square // 10
return sum == n
n = int(input("Enter a number: "))
if neon(n):
print("Neon Number")
else:
print("Not a Neon Number")
Output:
Enter a number: 9
Neon Number
n= int(input("Enter a number: "))
square = n * n
sum = 0
while square > 0:
sum = sum + (square % 10)
square = square // 10
if sum == n:
print("Neon Number")
else:
print("Not a Neon Number")
Output:
Enter a number: 5
Not a Neon Number
25)Strong Number
Strong Numbers are the numbers whose sum of factorial of digits is equal to the original number
n=145
1! = 1
4! = 24
5! = 120
1 + 24 + 120 = 145
def strong(n):
original = n
sum = 0
while n > 0:
digit = n % 10
fact = 1
i = 1
while i <= digit:
fact = fact * i
i = i + 1
sum = sum + fact
n = n // 10
return sum == original
n = int(input("Enter a number: "))
if strong(n):
print("Strong Number")
else:
print("Not a Strong Number")
Output:
Enter a number: 145
Strong Number
n = int(input("Enter a number: "))
sum = 0
while n> 0:
digit = n % 10
fact = 1
i = 1
while i <= digit:
fact = fact * i
i = i + 1
sum = sum + fact
n = n // 10
if sum == n:
print("Strong Number")
else:
print("Not a Strong Number")
Output:
Enter a number: 123
Not a Strong Number
Automorphic Number
An automorphic number is a number whose square ends in the same digits as the number itself
n=5
5^2 = 25
def automorphic(n):
original = n
square = n * n
div = 1
while n > 0:
div = div * 10
n = n // 10
return square % div == original
n = int(input("Enter a number: "))
if automorphic(n):
print("Automorphic Number")
else:
print("Not an Automorphic Number")
Output:
Enter a number: 6
Automorphic Number
n = int(input("Enter a number: "))
original = n
square = n * n
div = 1
while n > 0:
div = div * 10
n = n // 10
if square % div == original:
print("Automorphic Number")
else:
print("Not an Automorphic Number")
Output:
Enter a number: 7
Not an Automorphic Number
Duck Number
Duck Number is a positive non-zero number containing at least one zero in its numeric representation(10,1203,5104)
def duck(n):
while n > 0:
digit = n % 10
if digit == 0:
return True
n = n // 10
return False
n = int(input("Enter a number: "))
if duck(n):
print("Duck Number")
else:
print("Not a Duck Number")
Output:
Enter a number: 12
Not a Duck Number
n = int(input("Enter a number: "))
while n > 0:
digit = n % 10
if digit == 0:
print("Duck Number")
break
n = n // 10
else:
print("Not a Duck Number")
Output:
Enter a number: 120
Duck Number
Spy Number
if the sum of all the digits is equal to the multiple of all digits
n=123
sum=1+2+3=6
multiple=1*2*3=6
def spy(n):
sum = 0
mul = 1
while n > 0:
digit = n % 10
sum = sum + digit
mul = mul * digit
n = n // 10
return sum == mul
n = int(input("Enter a number: "))
if spy(n):
print("Spy Number")
else:
print("Not a Spy Number")
Output:
Enter a number: 123
Spy Number
n = int(input("Enter a number: "))
sum = 0
mul = 1
while n > 0:
digit = n % 10
sum = sum + digit
mul = mul * digit
n = n // 10
if sum == mul:
print("Spy Number")
else:
print("Not a Spy Number")
Output:
Enter a number: 1234
Not a Spy Number
Top comments (0)