title: A function to find the sum of prime factors of an integer number
body: <p>I am not able to meet all the conditions of prime factors of a number so that I find the correct sum. </p>
  
  <pre><code>    int sumPrime(number){
  
  
           int counter;
           int sum=0;
           for(counter=2;counter&lt;=(number/2);counter++){
             if(number%counter==0){
                sum=counter;
                counter++;
                sum+=counter;
  
  
                }
             return sum;  
  
            }
      }
  </code></pre>