Easy Recursive Soln.
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    int smallestValue(int n) {
        int initialVal = n;
        int sumPrimeFactors = 0;
        for(int div = 2; div * div <= n; div++) {
            while( n%div == 0) {
                sumPrimeFactors += div;
                n = n / div; 
            }
        }
        if( n > 1) {
            sumPrimeFactors += n;
        }
        if(sumPrimeFactors != initialVal){
            return smallestValue(sumPrimeFactors);
        }
        return sumPrimeFactors;
    }
};
```
['C++']