# Calculate n + nn + nnn + … + n(m times) in Python

The program is to find a mathematical series, where we need to accept the value of n and m. n is the base number and m is the number of times till which the series run.

Examples:

```Input : 2 + 22 + 222 + 2222 + 22222
Output : 24690

Input : 12 + 1212 + 121212
Output : 122436
```

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

We first convert the numbers into string format and concatenate them regularly. Later, we convert them back to integer and add them upto mth term. as shown in the following program.

 `# Python program to sum the given series ` ` `  `# Returns sum of n + nn + nnn + .... (m times) ` `def` `Series(n, m): ` ` `  `    ``# Converting the number to string ` `    ``str_n ``=` `str``(n) ` ` `  `    ``# Initializing result as number and string ` `    ``sums ``=` `n ` `    ``sum_str ``=` `str``(n) ` ` `  `    ``# Adding remaining terms ` `    ``for` `i ``in` `range``(``1``, m): ` `        `  `        ``# Concatenating the string making n, nn, nnn... ` `        ``sum_str ``=` `sum_str ``+` `str_n ` `         `  `        ``# Before adding converting back to integer ` `        ``sums ``=` `sums ``+` `int``(sum_str) ` ` `  `    ``return` `sums ` ` `  `# Driver Code ` `n ``=` `2` `m ``=` `5` `total ``=` `Series(n, m) ` `print``(total) `

Output:

```24690
```

Attention geek! Strengthen your foundations with the Python Programming Foundation Course and learn the basics.

To begin with, your interview preparations Enhance your Data Structures concepts with the Python DS Course.

My Personal Notes arrow_drop_up Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Improved By : nidhi_biet

Article Tags :
Practice Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.