Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,032; 200,000,000,960) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,032 = 25 × 3 × 11 × 281 × 337
100,000,032 is not a prime number but a composite one.
200,000,000,960 = 26 × 5 × 19 × 97 × 339,121
200,000,000,960 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,960 ÷ 100,000,032 = 1,999 + 99,936,992
Step 2. Divide the smaller number by the above operation's remainder:
100,000,032 ÷ 99,936,992 = 1 + 63,040
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,936,992 ÷ 63,040 = 1,585 + 18,592
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
63,040 ÷ 18,592 = 3 + 7,264
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
18,592 ÷ 7,264 = 2 + 4,064
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
7,264 ÷ 4,064 = 1 + 3,200
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,064 ÷ 3,200 = 1 + 864
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,200 ÷ 864 = 3 + 608
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
864 ÷ 608 = 1 + 256
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
608 ÷ 256 = 2 + 96
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
256 ÷ 96 = 2 + 64
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
96 ÷ 64 = 1 + 32
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
64 ÷ 32 = 2 + 0
At this step, the remainder is zero, so we stop:
32 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,032; 200,000,000,960) = 32 = 25
The two numbers have common prime factors