[Python3], Recursevily sum primes
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def smallestValue(self, n: int) -> int:\n        while ((r := self.sumPrimes(n)) != n):\n            n = r\n\n        return n\n\n    def sumPrimes(self, n: int) -> int:\n        sum = 0\n        for k in range(2, n + 1):\n            if (n % k == 0):\n                sum += k + self.sumPrimes(n // k)\n                break\n\n        return sum\n```
['Recursion', 'Python3']