What is the Greatest Common Factor of 73035 and 73048?

Greatest common factor (GCF) of 73035 and 73048 is 1.

GCF(73035,73048) = 1

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

How to find the GCF of 73035 and 73048?

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

Step-1: Prime Factorization of 73035

Prime factors of 73035 are 3, 5, 541. Prime factorization of 73035 in exponential form is:

73035 = 3³ × 5¹ × 541¹

Step-2: Prime Factorization of 73048

Prime factors of 73048 are 2, 23, 397. Prime factorization of 73048 in exponential form is:

73048 = 2³ × 23¹ × 397¹

Step-3: Factors of 73035

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

1, 3, 5, 9, 15, 27, 45, 135, 541, 1623, 2705, 4869, 8115, 14607, 24345

Step-4: Factors of 73048

List of positive integer factors of 73048 that divides 73035 without a remainder.

1, 2, 4, 8, 23, 46, 92, 184, 397, 794, 1588, 3176, 9131, 18262, 36524

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 73035 and 73048