GCF for 60 and 495
"Greatest Common Factor" Calculator
What is the Greatest common Divisor of 60 and 495?
Answer: GCF of 60 and 495 is 15
(Fifteen)
Finding GCF for 60 and 495 using all factors (divisors) listing
The first method to find GCF for numbers 60 and 495 is to list all factors for both numbers and pick the highest common one:
All factors of 60: 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60
All factors of 495: 1, 3, 5, 9, 11, 15, 33, 45, 55, 99, 165, 495
So the Greatest Common Factor for 60 and 495 is 15
Finding GCF for 60 and 495 by Prime Factorization
The second method to find GCF for numbers 60 and 495 is to list all Prime Factors for both numbers and multiply the common ones:
All Prime Factors of 60: 2, 2, 3, 5
All Prime Factors of 495: 3, 3, 5, 11
As we can see there are Prime Factors common to both numbers: 3, 5
Now we need to multiply them to find GCF: 3 × 5 = 15
Share This Calculation
Print
<a href="https://calculat.io/en/number/greatest-common-factor-of/60--495">What is the GCF of 60 and 495 - Calculatio</a>
GCF Table
| Number 1 | Number 2 | GCF |
|---|---|---|
| 45 | 495 | 45 |
| 46 | 495 | 1 |
| 47 | 495 | 1 |
| 48 | 495 | 3 |
| 49 | 495 | 1 |
| 50 | 495 | 5 |
| 51 | 495 | 3 |
| 52 | 495 | 1 |
| 53 | 495 | 1 |
| 54 | 495 | 9 |
| 55 | 495 | 55 |
| 56 | 495 | 1 |
| 57 | 495 | 3 |
| 58 | 495 | 1 |
| 59 | 495 | 1 |
| 60 | 495 | 15 |
| 61 | 495 | 1 |
| 62 | 495 | 1 |
| 63 | 495 | 9 |
| 64 | 495 | 1 |
| 65 | 495 | 5 |
| 66 | 495 | 33 |
| 67 | 495 | 1 |
| 68 | 495 | 1 |
| 69 | 495 | 3 |
| 70 | 495 | 5 |
| 71 | 495 | 1 |
| 72 | 495 | 9 |
| 73 | 495 | 1 |
| 74 | 495 | 1 |
About "Greatest Common Factor" Calculator
This calculator will help you find the greatest common factor (GCF) of two numbers. For example, it can help you find out what is the Greatest common Divisor of 60 and 495? (The answer is: 15). Select the first number (e.g. '60') and the second number (e.g. '495'). After that hit the 'Calculate' button.
Greatest Common Factor (GCF) also known as the Greatest Common Divisor (GCD) or Highest Common Factor (HCF) - it is the largest positive integer that divides each of the integers with zero remainder