Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,045; 200,000,000,505) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,045 = 5 × 61 × 327,869
100,000,045 is not a prime number but a composite one.
200,000,000,505 = 3 × 5 × 13,333,333,367
200,000,000,505 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,505 ÷ 100,000,045 = 1,999 + 99,910,550
Step 2. Divide the smaller number by the above operation's remainder:
100,000,045 ÷ 99,910,550 = 1 + 89,495
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,910,550 ÷ 89,495 = 1,116 + 34,130
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
89,495 ÷ 34,130 = 2 + 21,235
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
34,130 ÷ 21,235 = 1 + 12,895
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
21,235 ÷ 12,895 = 1 + 8,340
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
12,895 ÷ 8,340 = 1 + 4,555
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,340 ÷ 4,555 = 1 + 3,785
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,555 ÷ 3,785 = 1 + 770
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,785 ÷ 770 = 4 + 705
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
770 ÷ 705 = 1 + 65
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
705 ÷ 65 = 10 + 55
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
65 ÷ 55 = 1 + 10
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
55 ÷ 10 = 5 + 5
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
10 ÷ 5 = 2 + 0
At this step, the remainder is zero, so we stop:
5 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,045; 200,000,000,505) = 5
The two numbers have common prime factors