Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,062; 200,000,000,476) = ?
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,476 = 22 × 317 × 1,559 × 101,173
200,000,000,476 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,476 ÷ 100,000,062 = 1,999 + 99,876,538
Step 2. Divide the smaller number by the above operation's remainder:
100,000,062 ÷ 99,876,538 = 1 + 123,524
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,876,538 ÷ 123,524 = 808 + 69,146
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
123,524 ÷ 69,146 = 1 + 54,378
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
69,146 ÷ 54,378 = 1 + 14,768
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
54,378 ÷ 14,768 = 3 + 10,074
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
14,768 ÷ 10,074 = 1 + 4,694
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
10,074 ÷ 4,694 = 2 + 686
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,694 ÷ 686 = 6 + 578
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
686 ÷ 578 = 1 + 108
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
578 ÷ 108 = 5 + 38
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
108 ÷ 38 = 2 + 32
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
38 ÷ 32 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
32 ÷ 6 = 5 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 2 = 3 + 0
At this step, the remainder is zero, so we stop:
2 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,476) = 2
The two numbers have common prime factors