Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,134; 200,000,000,601) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,134 = 2 × 32 × 13 × 427,351
100,000,134 is not a prime number but a composite one.
200,000,000,601 = 32 × 53 × 4,027 × 104,119
200,000,000,601 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,601 ÷ 100,000,134 = 1,999 + 99,732,735
Step 2. Divide the smaller number by the above operation's remainder:
100,000,134 ÷ 99,732,735 = 1 + 267,399
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,732,735 ÷ 267,399 = 372 + 260,307
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
267,399 ÷ 260,307 = 1 + 7,092
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
260,307 ÷ 7,092 = 36 + 4,995
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
7,092 ÷ 4,995 = 1 + 2,097
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,995 ÷ 2,097 = 2 + 801
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,097 ÷ 801 = 2 + 495
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
801 ÷ 495 = 1 + 306
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
495 ÷ 306 = 1 + 189
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
306 ÷ 189 = 1 + 117
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
189 ÷ 117 = 1 + 72
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
117 ÷ 72 = 1 + 45
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
72 ÷ 45 = 1 + 27
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
45 ÷ 27 = 1 + 18
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
27 ÷ 18 = 1 + 9
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
18 ÷ 9 = 2 + 0
At this step, the remainder is zero, so we stop:
9 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,134; 200,000,000,601) = 9 = 32
The two numbers have common prime factors