Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,085; 200,000,000,045) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,085 = 5 × 37 × 540,541
100,000,085 is not a prime number but a composite one.
200,000,000,045 = 5 × 17 × 2,352,941,177
200,000,000,045 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,045 ÷ 100,000,085 = 1,999 + 99,830,130
Step 2. Divide the smaller number by the above operation's remainder:
100,000,085 ÷ 99,830,130 = 1 + 169,955
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,830,130 ÷ 169,955 = 587 + 66,545
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
169,955 ÷ 66,545 = 2 + 36,865
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
66,545 ÷ 36,865 = 1 + 29,680
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
36,865 ÷ 29,680 = 1 + 7,185
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
29,680 ÷ 7,185 = 4 + 940
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,185 ÷ 940 = 7 + 605
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
940 ÷ 605 = 1 + 335
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
605 ÷ 335 = 1 + 270
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
335 ÷ 270 = 1 + 65
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
270 ÷ 65 = 4 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
65 ÷ 10 = 6 + 5
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,085; 200,000,000,045) = 5
The two numbers have common prime factors