What is the Greatest Common Factor of 45748 and 45765?

Greatest common factor (GCF) of 45748 and 45765 is 1.

GCF(45748,45765) = 1

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

How to find the GCF of 45748 and 45765?

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

Step-1: Prime Factorization of 45748

Prime factors of 45748 are 2, 11437. Prime factorization of 45748 in exponential form is:

45748 = 2² × 11437¹

Step-2: Prime Factorization of 45765

Prime factors of 45765 are 3, 5, 113. Prime factorization of 45765 in exponential form is:

45765 = 3⁴ × 5¹ × 113¹

Step-3: Factors of 45748

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

1, 2, 4, 11437, 22874

Step-4: Factors of 45765

List of positive integer factors of 45765 that divides 45748 without a remainder.

1, 3, 5, 9, 15, 27, 45, 81, 113, 135, 339, 405, 565, 1017, 1695, 3051, 5085, 9153, 15255

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 45748 and 45765