title: Sum Factors Number
signature: function sumFactorsNumber(n) {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value) {
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual, expected){
      return convertToString(actual)===convertToString(expected);
  }
  
  function driver(n, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(76, 140);
    console.log(`TEST-0...${result}`);
  
    result = driver(21, 32);
    console.log(`TEST-1...${result}`);
  
    result = driver(4, 7);
    console.log(`TEST-2...${result}`);
  
    result = driver(49, 57);
    console.log(`TEST-3...${result}`);
  
    result = driver(35, 48);
    console.log(`TEST-4...${result}`);
  
    result = driver(55, 72);
    console.log(`TEST-5...${result}`);
  
    result = driver(43, 44);
    console.log(`TEST-6...${result}`);
  
    result = driver(39, 56);
    console.log(`TEST-7...${result}`);
  
    result = driver(36, 91);
    console.log(`TEST-8...${result}`);
  
    result = driver(5, 6);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
source_py: def sum_factors_number(n):
      result = 0
      for i in range(2, (int(math.sqrt(n)) + 1)):
          if ((n % i) == 0):
              if (i == (n / i)):
                  result = (result + i)
              else:
                  result = (result + (i + (n // i)))
      return ((result + n) + 1)
source_cpp: int sum_factors_number(int n) {
    int result = 0;
    for ( int i = 2;
    i <= sqrt ( n );
    i ++ ) {
      if ( n % i == 0 ) {
        if ( i == ( n / i ) ) result += i;
        else result += ( i + n / i );
      }
    }
    return ( result + n + 1 );
  }