Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,052; 200,000,000,462) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,052 = 22 × 17 × 151 × 9,739
100,000,052 is not a prime number but a composite one.
200,000,000,462 = 2 × 23 × 15,161 × 286,777
200,000,000,462 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,462 ÷ 100,000,052 = 1,999 + 99,896,514
Step 2. Divide the smaller number by the above operation's remainder:
100,000,052 ÷ 99,896,514 = 1 + 103,538
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,896,514 ÷ 103,538 = 964 + 85,882
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
103,538 ÷ 85,882 = 1 + 17,656
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
85,882 ÷ 17,656 = 4 + 15,258
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
17,656 ÷ 15,258 = 1 + 2,398
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
15,258 ÷ 2,398 = 6 + 870
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,398 ÷ 870 = 2 + 658
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
870 ÷ 658 = 1 + 212
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
658 ÷ 212 = 3 + 22
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
212 ÷ 22 = 9 + 14
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
22 ÷ 14 = 1 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
14 ÷ 8 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
8 ÷ 6 = 1 + 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,052; 200,000,000,462) = 2
The two numbers have common prime factors