Find the Sum of Digits of a Number Using Recursion

❮ Previous Next ❯

A Python program to find the sum of digits of a number using recursion.

Here’s a explanation of the code in points:

Function Definition: sum_of_digits(number) calculates the sum of digits of the given number using recursion.
Base Case: If the number is 0, the function returns 0 (ending the recursion).
Recursive Case: If the number is not 0, it adds the last digit (number % 10) to the sum of digits of the rest of the number (sum_of_digits(number // 10)).
User Input: Takes a number as input from the user.
Output: Prints the sum of digits of the given number.

Program:

def sum_of_digits(number):
    if number == 0:
        return 0
    else:
        return number % 10 + sum_of_digits(number // 10)


num = int(input("Enter a number: "))
print(f"The sum of digits of {num} is {sum_of_digits(num)}")

❮ Previous Next ❯

Python Practice Questions Tutorial

Python Practice Questions Tutorial

Find the Sum of Digits of a Number Using Recursion

Important Links

Python Practice Questions Tutorial

Python Practice Questions Tutorial

Python Coding Questions on Numbers

Python Coding Questions on String

Python Coding Questions On List

Python Coding Questions On Dictionary

Python Coding Questions On Star Pattern

Find the Sum of Digits of a Number Using Recursion

Important Links