The number 42497
42497 is a composite number with 8 divisors. Its prime factorisation is 7 × 13 × 467. Divisors (8): 1, 7, 13, 91, 467, 3269, 6071, 42497.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
42497 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
42497 is composite. Its prime factorisation is
- 3
The divisors add up to 52416; without 42497 itself that is 9919, so 42497 is deficient (9919 is less than 42497). Euler's totient φ(42497) = 33552 numbers up to 42497 share no factor with it.
- 4
The digits of 42497 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 225 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42497 = 7 \times 13 \times 467 \]
42497 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 52416 |
| Euler totient φ(n) | 33552 |
| Square | 1805995009 |
| Cube | 76749369897473 |
| Square root | 206.148005 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 225 |
| Scientific notation | 4.2497 × |
42497 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand four hundred and ninety-seven |
| Binary (base 2) | 1010011000000001 |
| Octal (base 8) | 123001 |
| Hexadecimal (base 16) | A601 |
| Base 3 | 2011021222 |
| As time | 42497 seconds = 11 h 48 min 17 s |
Is 42497 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 (42497 ÷ 7 = 6071) | 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 8) | 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 4) | 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 42497 a prime number?
No. 42497 = 7 × 13 × 467, so it is divisible by 7.
What are the factors of 42497?
1, 7, 13, 91, 467, 3269, 6071, 42497.
What is 42497 in binary?
1010011000000001 (hexadecimal A601, octal 123001).
What is the square root of 42497?
About 206.1480.
Is 42497 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 42497?
It is a composite number with 8 divisors.