Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Find minimum sum of factors of number

  • Difficulty Level : Medium
  • Last Updated : 31 Jan, 2022

Given a number, find minimum sum of its factors.
Examples: 
 

Input : 12
Output : 7
Explanation: 
Following are different ways to factorize 12 and
sum of factors in different ways.
12 = 12 * 1 = 12 + 1 = 13
12 = 2 * 6 = 2 + 6 = 8
12 = 3 * 4 = 3 + 4 = 7
12 = 2 * 2 * 3 = 2 + 2 + 3 = 7
Therefore minimum sum is 7

Input : 105
Output : 15

 

To minimize sum, we must factorize factors as long as possible. With this process, we prime factors. So to find minimum sum of product of number, we find sum of prime factors of product.
 

C++




// CPP program to find minimum
// sum of product of number
#include <bits/stdc++.h>
using namespace std;
 
// To find minimum sum of
// product of number
int findMinSum(int num)
{
    int sum = 0;
 
    // Find factors of number
    // and add to the sum
    for (int i = 2; i * i <= num; i++) {
        while (num % i == 0) {
            sum += i;
            num /= i;
        }
    }
    sum += num;
 
    // Return sum of numbers
    // having minimum product
    return sum;
}
 
// Driver program to test above function
int main()
{
    int num = 12;
 
    cout << findMinSum(num);
 
    return 0;
}
Java



// Java program to find minimum
// sum of product of number
 
public class Main {
 
    // To find minimum sum of
    // product of number
    static int findMinSum(int num)
    {
        int sum = 0;
 
        // Find factors of number
        // and add to the sum
        for (int i = 2; i * i <= num; i++) {
            while (num % i == 0) {
                sum += i;
                num /= i;
            }
        }
        sum += num;
 
        // Return sum of numbers
        // having minimum product
        return sum;
    }
 
    // Driver program to test above function
    public static void main(String[] args)
    {
        int num = 12;
        System.out.println(findMinSum(num));
    }
}
Python3



# Python program to find minimum
# sum of product of number
  
# To find minimum sum of
# product of number
def findMinSum(num):
    sum = 0
     
    # Find factors of number
    # and add to the sum
    i = 2
    while(i * i <= num):
        while(num % i == 0):
            sum += i
            num //= i
        i += 1
    sum += num
     
    # Return sum of numbers
    # having minimum product
    return sum
 
# Driver Code
num = 12
print (findMinSum(num))
 
# This code is contributed by Sachin Bisht
C#



// C# program to find minimum
// sum of product of number
using System;
 
public class GFG {
 
    // To find minimum sum of
    // product of number
    static int findMinSum(int num)
    {
        int sum = 0;
 
        // Find factors of number
        // and add to the sum
        for (int i = 2; i * i <= num; i++) {
            while (num % i == 0) {
                sum += i;
                num /= i;
            }
        }
        sum += num;
 
        // Return sum of numbers
        // having minimum product
        return sum;
    }
 
    // Driver Code
    public static void Main()
    {
        int num = 12;
        Console.Write(findMinSum(num));
    }
     
}
 
// This Code is contributed by Nitin Mittal.
PHP



<?php
// PHP program to find minimum
// sum of product of number
 
// To find minimum sum of
// product of number
function findMinSum($num)
{
    $sum = 0;
 
    // Find factors of number
    // and add to the sum
    for ($i = 2; $i * $i <= $num; $i++)
    {
        while ($num % $i == 0)
        {
            $sum += $i;
            $num /= $i;
        }
    }
    $sum += $num;
 
    // Return sum of numbers
    // having minimum product
    return $sum;
}
 
// Driver Code
$num = 12;
 
echo(findMinSum($num));
 
// This code is contributed by Ajit.
?>
Javascript



<script>
 
// Javascript program to find minimum
// sum of product of number
   
// To find minimum sum of
// product of number
function findMinSum(num)
{
    let sum = 0;
   
    // Find factors of number
    // and add to the sum
    for (let i = 2; i * i <= num; i++) 
    {
        while (num % i == 0) 
        {
            sum += i;
            num /= i;
        }
    }
    sum += num;
   
    // Return sum of numbers
    // having minimum product
    return sum;
}
   
// Driver Code
let num = 12;
   
document.write(findMinSum(num));
   
// This code is contributed by _saurabh_jaiswal.
 
</script>
Output: 
7
This article is contributed by nuclode. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
 

My Personal Notes
arrow_drop_up
Next

Finding power of prime number p in n!
Recommended Articles
Page :
Find number of factors of N when location of its two factors whose product is N is given
14, Aug 19
Maximum number of prime factors a number can have with exactly x factors
07, May 20
Check if a number exists having exactly N factors and K prime factors
10, May 20
Print all numbers whose set of prime factors is a subset of the set of the prime factors of X
22, Apr 19
Find sum of odd factors of a number
26, Dec 17
Find sum of even factors of a number
28, Dec 17
Queries on sum of odd number digit sums of all the factors of a number
13, May 18
Number of factors of very large number N modulo M where M is any prime number
31, Mar 20
Make two numbers equal by multiplying with their prime factors minimum number of times
17, Jun 21
Sum of M maximum distinct digit sum from 1 to N that are factors of K
04, Mar 20
Find four factors of N with maximum product and sum equal to N | Set-2
04, Oct 18
Find four factors of N with maximum product and sum equal to N
01, Oct 18
Find four factors of N with maximum product and sum equal to N | Set 3
10, Oct 18
Find prime factors of Array elements whose sum of exponents is divisible by K
15, Aug 20
Find sum of exponents of prime factors of numbers 1 to N
15, Jul 20
Find two proper factors of N such that their sum is coprime with N
10, Aug 21
Sum of all the factors of a number
23, Dec 17
Expressing a number as sum of consecutive | Set 2 (Using odd factors)
18, Apr 18
Sum of Factors of a Number using Prime Factorization
03, Oct 18
Sum of array elements which are prime factors of a given number
05, Mar 21
Check if Sum of total number of factors from 1 to N is even or odd
10, Mar 22
Find all factors of a natural number | Set 1
08, Mar 16
Queries to find whether a number has exactly four distinct factors or not
25, Oct 17
Program to find all Factors of a Number using recursion
28, Feb 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Medium





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!