Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,100; 200,000,000,545) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,100 = 22 × 52 × 101 × 9,901
100,000,100 is not a prime number but a composite one.
200,000,000,545 = 5 × 67 × 23,741 × 25,147
200,000,000,545 is not a prime number but a composite one.
- Prime number: a natural number that is only divisible by 1 and itself. A prime number has exactly two factors: 1 and itself.
- Composite number: a natural number that has at least one other factor than 1 and itself.
Calculate the greatest (highest) common factor (divisor):
Multiply all the common prime factors, taken by their smallest exponents (the smallest powers).
Step 1. Divide the larger number by the smaller one:
200,000,000,545 ÷ 100,000,100 = 1,999 + 99,800,645
Step 2. Divide the smaller number by the above operation's remainder:
100,000,100 ÷ 99,800,645 = 1 + 199,455
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,800,645 ÷ 199,455 = 500 + 73,145
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
199,455 ÷ 73,145 = 2 + 53,165
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
73,145 ÷ 53,165 = 1 + 19,980
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
53,165 ÷ 19,980 = 2 + 13,205
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
19,980 ÷ 13,205 = 1 + 6,775
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
13,205 ÷ 6,775 = 1 + 6,430
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,775 ÷ 6,430 = 1 + 345
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
6,430 ÷ 345 = 18 + 220
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
345 ÷ 220 = 1 + 125
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
220 ÷ 125 = 1 + 95
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
125 ÷ 95 = 1 + 30
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
95 ÷ 30 = 3 + 5
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
30 ÷ 5 = 6 + 0
At this step, the remainder is zero, so we stop:
5 is the number we were looking for - the last non-zero remainder.
This is the greatest (highest) common factor (divisor).
The greatest (highest) common factor (divisor):
gcf, hcf, gcd (100,000,100; 200,000,000,545) = 5
The two numbers have common prime factors