What is the Greatest Common Factor of 84748 and 84761?

Greatest common factor (GCF) of 84748 and 84761 is 1.

GCF(84748,84761) = 1

We will now calculate the prime factors of 84748 and 84761, than find the greatest common factor (greatest common divisor (gcd)) of the numbers by matching the biggest common factor of 84748 and 84761.

How to find the GCF of 84748 and 84761?

We will first find the prime factorization of 84748 and 84761. After we will calculate the factors of 84748 and 84761 and find the biggest common factor number .

Step-1: Prime Factorization of 84748

Prime factors of 84748 are 2, 21187. Prime factorization of 84748 in exponential form is:

84748 = 2² × 21187¹

Step-2: Prime Factorization of 84761

Prime factors of 84761 are 84761. Prime factorization of 84761 in exponential form is:

84761 = 84761¹

Step-3: Factors of 84748

List of positive integer factors of 84748 that divides 84748 without a remainder.

1, 2, 4, 21187, 42374

Step-4: Factors of 84761

List of positive integer factors of 84761 that divides 84748 without a remainder.

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 84748 and 84761. The biggest common factor number is the GCF number.
So the greatest common factor 84748 and 84761 is 1.

Also check out the Least Common Multiple of 84748 and 84761