# Python Data Structures and Algorithms - Recursion: Convert an integer to a string in any base

## Python Recursion: Exercise-2 with Solution

Write a Python program to convert an integer to a string in any base using recursion.

**Sample Solution**:

**Python Code:**

```
# Define a function named to_string that converts a number 'n' to a string representation
# in a given 'base' using a character set "0123456789ABCDEF"
def to_string(n, base):
# Define a character set for the conversion in hexadecimal format
conver_tString = "0123456789ABCDEF"
# Check if the number 'n' is less than the specified base
if n < base:
# If 'n' is less than the base, return the corresponding character from the character set
return conver_tString[n]
else:
# If 'n' is greater than or equal to the base, recursively call the to_string function
# to convert the quotient (n // base) to a string and concatenate it with the remainder
# (n % base) represented in the character set
return to_string(n // base, base) + conver_tString[n % base]
# Print the result of calling the to_string function with the input values 2835 and 16
print(to_string(2835, 16))
```

Sample Output:

B13

**Flowchart:**

**Python Code Editor:**

** Contribute your code and comments through Disqus.**

**Previous:** Write a Python program to calculate the sum of a list of numbers.

**Next:** Write a Python program of recursion list sum.

**What is the difficulty level of this exercise?**

Test your Programming skills with w3resource's quiz.

**Weekly Trends and Language Statistics**- Weekly Trends and Language Statistics