Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,062; 200,000,000,283) = ?
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,283 = 3 × 17 × 53 × 659 × 112,279
200,000,000,283 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,283 ÷ 100,000,062 = 1,999 + 99,876,345
Step 2. Divide the smaller number by the above operation's remainder:
100,000,062 ÷ 99,876,345 = 1 + 123,717
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,876,345 ÷ 123,717 = 807 + 36,726
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
123,717 ÷ 36,726 = 3 + 13,539
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
36,726 ÷ 13,539 = 2 + 9,648
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
13,539 ÷ 9,648 = 1 + 3,891
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,648 ÷ 3,891 = 2 + 1,866
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,891 ÷ 1,866 = 2 + 159
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,866 ÷ 159 = 11 + 117
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
159 ÷ 117 = 1 + 42
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
117 ÷ 42 = 2 + 33
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
42 ÷ 33 = 1 + 9
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
33 ÷ 9 = 3 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
9 ÷ 6 = 1 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 3 = 2 + 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,062; 200,000,000,283) = 3
The two numbers have common prime factors