The number 56497
56497 is a composite number with 6 divisors. Its prime factorisation is Ć 1153. Divisors (6): 1, 7, 49, 1153, 8071, 56497.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56497 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56497 is composite. Its prime factorisation is
- 3
The divisors add up to 65778; without 56497 itself that is 9281, so 56497 is deficient (9281 is less than 56497). Euler's totient Ļ(56497) = 48384 numbers up to 56497 share no factor with it.
- 4
The digits of 56497 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56497 = 7^{2} \times 1153 \]56497 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 65778 |
| Euler totient Ļ(n) | 48384 |
| Square | 3191911009 |
| Cube | 180333396275473 |
| Square root | 237.690976 (= 7ā1153) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.6497 Ć |
56497 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand four hundred and ninety-seven |
| Binary (base 2) | 1101110010110001 |
| Octal (base 8) | 156261 |
| Hexadecimal (base 16) | DCB1 |
| Base 3 | 2212111111 |
| As time | 56497 seconds = 15 h 41 min 37 s |
Is 56497 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (56497 Ć· 7 = 8071) | 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 4) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56497 a prime number?
No. 56497 = Ć 1153, so it is divisible by 7.
What are the factors of 56497?
1, 7, 49, 1153, 8071, 56497.
What is 56497 in binary?
1101110010110001 (hexadecimal DCB1, octal 156261).
What is the square root of 56497?
About 237.6910, exactly 7ā1153.
Is 56497 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 56497?
It is a composite number with 6 divisors.