Sum Of Digit Of A Number Using Recursion Through Python Programming

Share Your Love

In this post, I will discuss Sum Of Digit Of A Number Using Recursion Through Python Programming.

Given a number, we need to find sum of its digits using recursion.


Input : 12345
Output : 15

Input : 45632
Output :20

Now, the step by step process for a better understanding of how this algorithm works,

Lets, Take the example 12345


12345 % 10 which is equal-too 5 + and then send 12345/10 to next step.


1234 % 10 which is equal-too 4 + and then send 1234/10 to next step.


123 % 10 which is equal-too 3 + and then send 123/10 to next step.


12 % 10 which is equal-too 2 + and then send 12/10 to next step.


 1 % 10 which is equal-too 1 and then send 1/10 to next step.


 0 algorithm stops.

Here, following diagram will illustrate the process of recursion:

Sum Of Digit Of Number Using Recursion
# Recursive Python3 program to
# find sum of digits of a number

# Function to check sum of
# digit using recursion
def sum_of_digit( n ):
	if n == 0:
		return 0
	return (n % 10 + sum_of_digit(int(n / 10)))

# Driven code to check above
num = 12345
result = sum_of_digit(num)
print("Sum of digits in",num,"is", result)

# This code is contributed by "Sharad_Bhardwaj".


Sum of digits in 12345 is 15

Please comment and share this post and wants to add more content to this website please WhatsApp us.

Share Your Love
Avatar photo
Lingaraj Senapati

Hey There! I am Lingaraj Senapati, the Founder of My skills are Freelance, Web Developer & Designer, Corporate Trainer, Digital Marketer & Youtuber.

Articles: 429

Newsletter Updates

Enter your email address below to subscribe to our newsletter