Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,098; 200,000,000,985) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,098 = 2 × 32 × 11 × 505,051
100,000,098 is not a prime number but a composite one.
200,000,000,985 = 3 × 5 × 31 × 430,107,529
200,000,000,985 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,985 ÷ 100,000,098 = 1,999 + 99,805,083
Step 2. Divide the smaller number by the above operation's remainder:
100,000,098 ÷ 99,805,083 = 1 + 195,015
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,805,083 ÷ 195,015 = 511 + 152,418
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
195,015 ÷ 152,418 = 1 + 42,597
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
152,418 ÷ 42,597 = 3 + 24,627
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
42,597 ÷ 24,627 = 1 + 17,970
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
24,627 ÷ 17,970 = 1 + 6,657
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
17,970 ÷ 6,657 = 2 + 4,656
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,657 ÷ 4,656 = 1 + 2,001
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
4,656 ÷ 2,001 = 2 + 654
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
2,001 ÷ 654 = 3 + 39
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
654 ÷ 39 = 16 + 30
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
39 ÷ 30 = 1 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
30 ÷ 9 = 3 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
9 ÷ 3 = 3 + 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,098; 200,000,000,985) = 3
The two numbers have common prime factors