Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (4,488; 6,806) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
4,488 = 23 × 3 × 11 × 17
4,488 is not a prime number but a composite one.
6,806 = 2 × 41 × 83
6,806 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:
6,806 ÷ 4,488 = 1 + 2,318
Step 2. Divide the smaller number by the above operation's remainder:
4,488 ÷ 2,318 = 1 + 2,170
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
2,318 ÷ 2,170 = 1 + 148
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
2,170 ÷ 148 = 14 + 98
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
148 ÷ 98 = 1 + 50
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
98 ÷ 50 = 1 + 48
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
50 ÷ 48 = 1 + 2
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
48 ÷ 2 = 24 + 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 (4,488; 6,806) = 2
The two numbers have common prime factors