Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,062; 200,000,000,511) = ?
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,511 = 32 × 211 × 4,271 × 24,659
200,000,000,511 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,511 ÷ 100,000,062 = 1,999 + 99,876,573
Step 2. Divide the smaller number by the above operation's remainder:
100,000,062 ÷ 99,876,573 = 1 + 123,489
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,876,573 ÷ 123,489 = 808 + 97,461
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
123,489 ÷ 97,461 = 1 + 26,028
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
97,461 ÷ 26,028 = 3 + 19,377
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
26,028 ÷ 19,377 = 1 + 6,651
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
19,377 ÷ 6,651 = 2 + 6,075
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,651 ÷ 6,075 = 1 + 576
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,075 ÷ 576 = 10 + 315
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
576 ÷ 315 = 1 + 261
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
315 ÷ 261 = 1 + 54
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
261 ÷ 54 = 4 + 45
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
54 ÷ 45 = 1 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
45 ÷ 9 = 5 + 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,511) = 9 = 32
The two numbers have common prime factors