This is a Python Program to find the sum of the digits of the number recursively.

The program takes a number and finds the sum of the digits of the number recursively.

1. Define a recursive function which takes a number as the argument.

2. Take a number from the user and pass it as an argument to a recursive function.

3. In the function, put the base condition that if the number is zero, return the formed list.

4. Otherwise, get each digit and append it to the list.

5. Find the sum of the digits in the list outside the function.

6. Print the total sum.

7. Exit.

Here is source code of the Python Program to find the binary equivalent of a number recursively. The program output is also shown below.

l=[] def sum_digits(b): if(b==0): return l dig=b%10 l.append(dig) sum_digits(b//10) n=int(input("Enter a number: ")) sum_digits(n) print(sum(l))

1. A recursive function is defined which takes a number as the argument.

2. A number is taken from the user and passed as an argument to a recursive function.

3. In the function, the base condition is that if the number is zero, the formed list is returned.

4. Otherwise, each digit is obtained using a modulus operator and appended to the list.

5. The function is then called with the number taken from the user and the sum of the digits in the list is found out.

6. The total sum is printed.

Case 1: Enter a number: 135 9 Case 2: Enter a number: 546 15

**Sanfoundry Global Education & Learning Series – Python Programs.**

To practice all Python programs, __here is complete set of 150+ Python Problems and Solutions__.