Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,092; 200,000,000,565) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,092 = 22 × 3 × 71 × 117,371
100,000,092 is not a prime number but a composite one.
200,000,000,565 = 32 × 5 × 151 × 1,063 × 27,689
200,000,000,565 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,565 ÷ 100,000,092 = 1,999 + 99,816,657
Step 2. Divide the smaller number by the above operation's remainder:
100,000,092 ÷ 99,816,657 = 1 + 183,435
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,816,657 ÷ 183,435 = 544 + 28,017
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
183,435 ÷ 28,017 = 6 + 15,333
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
28,017 ÷ 15,333 = 1 + 12,684
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
15,333 ÷ 12,684 = 1 + 2,649
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
12,684 ÷ 2,649 = 4 + 2,088
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,649 ÷ 2,088 = 1 + 561
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,088 ÷ 561 = 3 + 405
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
561 ÷ 405 = 1 + 156
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
405 ÷ 156 = 2 + 93
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
156 ÷ 93 = 1 + 63
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
93 ÷ 63 = 1 + 30
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
63 ÷ 30 = 2 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
30 ÷ 3 = 10 + 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,092; 200,000,000,565) = 3
The two numbers have common prime factors