Calculate GCF (1,589; 6,854), the Greatest (Highest) Common Factor (Divisor), (HCF, GCD), of the Numbers. Online Calculator
Calculate the greatest common factor, GCF (1,589; 6,854), using their prime factorizations, numbers' divisibility or the Euclidean algorithm
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
1,589 = 7 × 227
1,589 is not a prime number but a composite one.
6,854 = 2 × 23 × 149
6,854 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).
But the two numbers have no common prime factors.
The greatest (highest) common factor (divisor),
gcf, hcf, gcd (1,589; 6,854) = 1
Coprime numbers (prime to each other, relatively prime).
Scroll down for the 2nd method...
Method 2. The Euclidean Algorithm:
This algorithm involves the process of dividing numbers and calculating the remainders.
'a' and 'b' are the two natural numbers, 'a' >= 'b'.
Divide 'a' by 'b' and get the remainder of the operation, 'r'.
If 'r' = 0, STOP. 'b' = the gcf (hcf, gcd) of 'a' and 'b'.
Else: Replace ('a' by 'b') and ('b' by 'r'). Return to the step above.
Step 1. Divide the larger number by the smaller one:
6,854 ÷ 1,589 = 4 + 498
Step 2. Divide the smaller number by the above operation's remainder:
1,589 ÷ 498 = 3 + 95
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
498 ÷ 95 = 5 + 23
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
95 ÷ 23 = 4 + 3
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
23 ÷ 3 = 7 + 2
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3 ÷ 2 = 1 + 1
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2 ÷ 1 = 2 + 0
At this step, the remainder is zero, so we stop:
1 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 (1,589; 6,854) = 1
Coprime numbers (prime to each other, relatively prime).
The two numbers have no prime factors in common
Why do we need to calculate the greatest common factor?
Once you've calculated the greatest common factor of the numerator and the denominator of a fraction, it becomes much easier to fully reduce (simplify) the fraction to the lowest terms (the smallest possible numerator and denominator).
Other similar operations with the greatest (highest) common factor (divisor):