Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,016; 200,000,000,280) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,016 = 24 × 97 × 64,433
100,000,016 is not a prime number but a composite one.
200,000,000,280 = 23 × 3 × 5 × 461 × 3,615,329
200,000,000,280 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,280 ÷ 100,000,016 = 1,999 + 99,968,296
Step 2. Divide the smaller number by the above operation's remainder:
100,000,016 ÷ 99,968,296 = 1 + 31,720
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,968,296 ÷ 31,720 = 3,151 + 18,576
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
31,720 ÷ 18,576 = 1 + 13,144
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
18,576 ÷ 13,144 = 1 + 5,432
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
13,144 ÷ 5,432 = 2 + 2,280
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,432 ÷ 2,280 = 2 + 872
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,280 ÷ 872 = 2 + 536
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
872 ÷ 536 = 1 + 336
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
536 ÷ 336 = 1 + 200
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
336 ÷ 200 = 1 + 136
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
200 ÷ 136 = 1 + 64
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
136 ÷ 64 = 2 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
64 ÷ 8 = 8 + 0
At this step, the remainder is zero, so we stop:
8 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,016; 200,000,000,280) = 8 = 23
The two numbers have common prime factors