title: Find Sum Odd Factors Number
signature: function findSumOddFactorsNumber(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(20, 6);
    console.log(`TEST-0...${result}`);
  
    result = driver(6, 4);
    console.log(`TEST-1...${result}`);
  
    result = driver(39, 56);
    console.log(`TEST-2...${result}`);
  
    result = driver(80, 6);
    console.log(`TEST-3...${result}`);
  
    result = driver(88, 12);
    console.log(`TEST-4...${result}`);
  
    result = driver(7, 8);
    console.log(`TEST-5...${result}`);
  
    result = driver(16, 1);
    console.log(`TEST-6...${result}`);
  
    result = driver(27, 40);
    console.log(`TEST-7...${result}`);
  
    result = driver(83, 84);
    console.log(`TEST-8...${result}`);
  
    result = driver(6, 4);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
source_py: def find_sum_odd_factors_number(n):
      res = 1
      while ((n % 2) == 0):
          n = (n // 2)
      for i in range(3, int((math.sqrt(n) + 1))):
          count = 0
          curr_sum = 1
          curr_term = 1
          while ((n % i) == 0):
              count += 1
              n = (n // i)
              curr_term *= i
              curr_sum += curr_term
          res *= curr_sum
      if (n >= 2):
          res *= (1 + n)
      return res
source_cpp: int find_sum_odd_factors_number(int n) {
    int res = 1;
    while ( n % 2 == 0 ) n = n / 2;
    for ( int i = 3;
    i <= sqrt ( n );
    i ++ ) {
      int count = 0, curr_sum = 1;
      int curr_term = 1;
      while ( n % i == 0 ) {
        count ++;
        n = n / i;
        curr_term *= i;
        curr_sum += curr_term;
      }
      res *= curr_sum;
    }
    if ( n >= 2 ) res *= ( 1 + n );
    return res;
  }