What is the Greatest Common Factor of 82748 and 82765?

Greatest common factor (GCF) of 82748 and 82765 is 1.

GCF(82748,82765) = 1

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

How to find the GCF of 82748 and 82765?

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

Step-1: Prime Factorization of 82748

Prime factors of 82748 are 2, 137, 151. Prime factorization of 82748 in exponential form is:

82748 = 2² × 137¹ × 151¹

Step-2: Prime Factorization of 82765

Prime factors of 82765 are 5, 16553. Prime factorization of 82765 in exponential form is:

82765 = 5¹ × 16553¹

Step-3: Factors of 82748

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

1, 2, 4, 137, 151, 274, 302, 548, 604, 20687, 41374

Step-4: Factors of 82765

List of positive integer factors of 82765 that divides 82748 without a remainder.

1, 5, 16553

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 82748 and 82765