Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,134; 200,000,000,397) = ?
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,397 = 3 × 83 × 803,212,853
200,000,000,397 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,397 ÷ 100,000,134 = 1,999 + 99,732,531
Step 2. Divide the smaller number by the above operation's remainder:
100,000,134 ÷ 99,732,531 = 1 + 267,603
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,732,531 ÷ 267,603 = 372 + 184,215
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
267,603 ÷ 184,215 = 1 + 83,388
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
184,215 ÷ 83,388 = 2 + 17,439
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
83,388 ÷ 17,439 = 4 + 13,632
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
17,439 ÷ 13,632 = 1 + 3,807
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
13,632 ÷ 3,807 = 3 + 2,211
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,807 ÷ 2,211 = 1 + 1,596
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,211 ÷ 1,596 = 1 + 615
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,596 ÷ 615 = 2 + 366
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
615 ÷ 366 = 1 + 249
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
366 ÷ 249 = 1 + 117
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
249 ÷ 117 = 2 + 15
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
117 ÷ 15 = 7 + 12
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
15 ÷ 12 = 1 + 3
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
12 ÷ 3 = 4 + 0
At this step, the remainder is zero, so we stop:
3 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,397) = 3
The two numbers have common prime factors