What is the Greatest Common Factor of 84730 and 84748?

Greatest common factor (GCF) of 84730 and 84748 is 2.

GCF(84730,84748) = 2

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

How to find the GCF of 84730 and 84748?

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

Step-1: Prime Factorization of 84730

Prime factors of 84730 are 2, 5, 37, 229. Prime factorization of 84730 in exponential form is:

84730 = 2¹ × 5¹ × 37¹ × 229¹

Step-2: Prime Factorization of 84748

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

84748 = 2² × 21187¹

Step-3: Factors of 84730

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

1, 2, 5, 10, 37, 74, 185, 229, 370, 458, 1145, 2290, 8473, 16946, 42365

Step-4: Factors of 84748

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

1, 2, 4, 21187, 42374

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 84730 and 84748