Phase 2 - Level 2: Number-based Looping Logic
Apply loops to solve number manipulation problems.
14 programs · open one, then the next
Start with Count Digits in a Number- 01Count Digits in a NumberIntermediateCount digits in a number.Open example →py# Take number num = int(input("Enter a number: ")) # Count digits
- 02Reverse a NumberIntermediateReverse the digits of a number.Open example →py# Take number num = int(input("Enter a number: ")) # Reverse number
- 03Check Palindrome NumberIntermediateCheck if a number is palindrome.Open example →py# Take number num = int(input("Enter a number: ")) # Reverse number
- 04Sum of DigitsIntermediateCalculate sum of digits of a number.Open example →py# Take number num = int(input("Enter a number: ")) # Sum of digits
- 05Armstrong Number CheckIntermediateCheck if a number is Armstrong number.Open example →py# Take number num = int(input("Enter a number: ")) # Count digits
- 06Perfect Number CheckIntermediateCheck if a number is perfect number.Open example →py# Take number num = int(input("Enter a number: ")) # Find sum of proper divisors
- 07Print Primes Between 1-100IntermediatePrint all prime numbers between 1 and 100.Open example →py# Print primes from 1 to 100 print("Prime numbers from 1 to 100:") for num in range(2, 101): is_prime = True
- 08Check if Number is PrimeIntermediateCheck if a number is prime.Open example →py# Take number num = int(input("Enter a number: ")) # Check prime
- 09Fibonacci Series Up to NIntermediatePrint Fibonacci series up to n terms.Open example →py# Take n n = int(input("Enter number of terms: ")) # Generate Fibonacci
- 10Sum of First N Fibonacci TermsIntermediateCalculate sum of first n Fibonacci terms.Open example →py# Take n n = int(input("Enter n: ")) # Calculate sum
- 11Product of DigitsIntermediateCalculate product of digits of a number.Open example →py# Take number num = int(input("Enter a number: ")) # Calculate product
- 12Strong Number CheckIntermediateCheck if number is strong (sum of factorial of digits equals number).Open example →py# Helper function for factorial def factorial(n): if n == 0 or n == 1: return 1
- 13Harshad Number CheckIntermediateCheck if number is Harshad (divisible by sum of digits).Open example →py# Take number num = int(input("Enter a number: ")) # Calculate sum of digits
- 14Abundant Number CheckIntermediateCheck if sum of proper divisors exceeds the number.Open example →py# Take number num = int(input("Enter a number: ")) # Find sum of proper divisors