Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,105; 200,000,000,520) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,105 = 5 × 233 × 85,837
100,000,105 is not a prime number but a composite one.
200,000,000,520 = 23 × 32 × 5 × 31 × 47 × 381,301
200,000,000,520 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,520 ÷ 100,000,105 = 1,999 + 99,790,625
Step 2. Divide the smaller number by the above operation's remainder:
100,000,105 ÷ 99,790,625 = 1 + 209,480
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,790,625 ÷ 209,480 = 476 + 78,145
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
209,480 ÷ 78,145 = 2 + 53,190
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
78,145 ÷ 53,190 = 1 + 24,955
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
53,190 ÷ 24,955 = 2 + 3,280
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
24,955 ÷ 3,280 = 7 + 1,995
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,280 ÷ 1,995 = 1 + 1,285
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,995 ÷ 1,285 = 1 + 710
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,285 ÷ 710 = 1 + 575
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
710 ÷ 575 = 1 + 135
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
575 ÷ 135 = 4 + 35
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
135 ÷ 35 = 3 + 30
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
35 ÷ 30 = 1 + 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,105; 200,000,000,520) = 5
The two numbers have common prime factors