Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (23,232,438; 32,323,232) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
23,232,438 = 2 × 32 × 17 × 23 × 3,301
23,232,438 is not a prime number but a composite one.
32,323,232 = 25 × 73 × 101 × 137
32,323,232 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:
32,323,232 ÷ 23,232,438 = 1 + 9,090,794
Step 2. Divide the smaller number by the above operation's remainder:
23,232,438 ÷ 9,090,794 = 2 + 5,050,850
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
9,090,794 ÷ 5,050,850 = 1 + 4,039,944
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
5,050,850 ÷ 4,039,944 = 1 + 1,010,906
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
4,039,944 ÷ 1,010,906 = 3 + 1,007,226
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,010,906 ÷ 1,007,226 = 1 + 3,680
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,007,226 ÷ 3,680 = 273 + 2,586
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,680 ÷ 2,586 = 1 + 1,094
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,586 ÷ 1,094 = 2 + 398
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,094 ÷ 398 = 2 + 298
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
398 ÷ 298 = 1 + 100
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
298 ÷ 100 = 2 + 98
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
100 ÷ 98 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
98 ÷ 2 = 49 + 0
At this step, the remainder is zero, so we stop:
2 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 (23,232,438; 32,323,232) = 2
The two numbers have common prime factors