Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,897; 200,000,000,655) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,897 = 3 × 43 × 775,193
99,999,897 is not a prime number but a composite one.
200,000,000,655 = 32 × 5 × 7 × 13 × 1,579 × 30,931
200,000,000,655 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,655 ÷ 99,999,897 = 2,000 + 206,655
Step 2. Divide the smaller number by the above operation's remainder:
99,999,897 ÷ 206,655 = 483 + 185,532
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
206,655 ÷ 185,532 = 1 + 21,123
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
185,532 ÷ 21,123 = 8 + 16,548
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
21,123 ÷ 16,548 = 1 + 4,575
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
16,548 ÷ 4,575 = 3 + 2,823
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,575 ÷ 2,823 = 1 + 1,752
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,823 ÷ 1,752 = 1 + 1,071
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,752 ÷ 1,071 = 1 + 681
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,071 ÷ 681 = 1 + 390
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
681 ÷ 390 = 1 + 291
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
390 ÷ 291 = 1 + 99
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
291 ÷ 99 = 2 + 93
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
99 ÷ 93 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
93 ÷ 6 = 15 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
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 (99,999,897; 200,000,000,655) = 3
The two numbers have common prime factors