Dev.to WebDev 🛠 Dev 👁 0

Python learning series | Day 1 Smiple program

1) Count the number number = 123456 count = 0 while nummber > 0: number = number // 10 # Remove last value count += 1 print(count) #6 2) Sum of digits number = 1234 sum_of_digits = 0

1) Count the number

number = 123456
count = 0
while nummber > 0:
   number = number // 10  # Remove last value
   count += 1

print(count)    #6 

2) Sum of digits

number = 1234
sum_of_digits = 0
while number > 0 :
   sum_of_digits = sum_of_digits  + number % 10  # display last value
   number = number // 10

print(sum_of_digits)  # 10

3) Reverse a number

number = 2545
reverse_number = 0
while number > 0 :
    reverse_number = (reverse_number*10) + number % 10
    number = number // 10

print(reverse_number)  #5452

4) To check Palindrome or not

number =  121
temp_number = number
reverse_number = 0
while number > 0 :
    reverse_number = (reverse_number * 10) + number % 10 
    number = number // 10 
print(reverse_number)

if reverse_number == temp_number :
    print("palindrome")
else :
    print("Not Palindrome")

output

plaindrome

4) find two digit smallest prime number and biggest prime number

📰 Read the original article on Dev.to WebDev

Originally published by Dev.to WebDev. Aggregated on AIWithGhost for educational purposes — full credit and traffic to the original publisher.