Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,062; 200,000,000,331) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,062 = 2 × 33 × 29 × 63,857
100,000,062 is not a prime number but a composite one.
200,000,000,331 = 32 × 3,617 × 6,143,827
200,000,000,331 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,331 ÷ 100,000,062 = 1,999 + 99,876,393
Step 2. Divide the smaller number by the above operation's remainder:
100,000,062 ÷ 99,876,393 = 1 + 123,669
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,876,393 ÷ 123,669 = 807 + 75,510
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
123,669 ÷ 75,510 = 1 + 48,159
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
75,510 ÷ 48,159 = 1 + 27,351
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
48,159 ÷ 27,351 = 1 + 20,808
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
27,351 ÷ 20,808 = 1 + 6,543
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
20,808 ÷ 6,543 = 3 + 1,179
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,543 ÷ 1,179 = 5 + 648
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,179 ÷ 648 = 1 + 531
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
648 ÷ 531 = 1 + 117
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
531 ÷ 117 = 4 + 63
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
117 ÷ 63 = 1 + 54
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
63 ÷ 54 = 1 + 9
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
54 ÷ 9 = 6 + 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,062; 200,000,000,331) = 9 = 32
The two numbers have common prime factors