The number 497
497 is a composite number with 4 divisors. Its prime factorisation is 7 × 71. Divisors (4): 1, 7, 71, 497.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 497: a semiprime: 7 × 71, the product of two primes.
- 2
497 is composite. Its prime factorisation is
- 3
The divisors add up to 576; without 497 itself that is 79, so 497 is deficient (79 is less than 497). Euler's totient φ(497) = 420 numbers up to 497 share no factor with it.
- 4
The digits of 497 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 22 steps to reach 1.
LaTeX source of the formulas on this page
\[ 497 = 7 \times 71 \]
497 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 576 |
| Euler totient φ(n) | 420 |
| Square | 247009 |
| Cube | 122763473 |
| Square root | 22.293497 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 22 |
| Scientific notation | 4.97 × |
497 in other forms
| Form | Value |
|---|---|
| In words | four hundred and ninety-seven |
| Roman numerals | CDXCVII |
| Binary (base 2) | 111110001 |
| Octal (base 8) | 761 |
| Hexadecimal (base 16) | 1F1 |
| Base 3 | 200102 |
| As time | 497 seconds = 8 min 17 s |
Is 497 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (497 ÷ 7 = 71) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | No (remainder 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 497 a prime number?
No. 497 = 7 × 71, so it is divisible by 7.
What are the factors of 497?
1, 7, 71, 497.
What is 497 in binary?
111110001 (hexadecimal 1F1, octal 761).
What is the square root of 497?
About 22.2935.
What is 497 in Roman numerals?
CDXCVII.
Is 497 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 497?
497 is a semiprime: 7 × 71, the product of two primes.