What is the Greatest Common Factor of 32748 and 32765?

Greatest common factor (GCF) of 32748 and 32765 is 1.

GCF(32748,32765) = 1

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

How to find the GCF of 32748 and 32765?

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

Step-1: Prime Factorization of 32748

Prime factors of 32748 are 2, 3, 2729. Prime factorization of 32748 in exponential form is:

32748 = 2² × 3¹ × 2729¹

Step-2: Prime Factorization of 32765

Prime factors of 32765 are 5, 6553. Prime factorization of 32765 in exponential form is:

32765 = 5¹ × 6553¹

Step-3: Factors of 32748

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

1, 2, 3, 4, 6, 12, 2729, 5458, 8187, 10916, 16374

Step-4: Factors of 32765

List of positive integer factors of 32765 that divides 32748 without a remainder.

1, 5, 6553

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 32748 and 32765