The number 56465
56465 is a palindrome: it reads 56465 backwards too. Its prime factorisation is 5 × 23 × 491. Divisors (8): 1, 5, 23, 115, 491, 2455, 11293, 56465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56465: a palindrome: it reads 56465 backwards too.
- 2
56465 is composite. Its prime factorisation is
- 3
The divisors add up to 70848; without 56465 itself that is 14383, so 56465 is deficient (14383 is less than 56465). Euler's totient φ(56465) = 43120 numbers up to 56465 share no factor with it.
- 4
The digits of 56465 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 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56465 = 5 \times 23 \times 491 \]
56465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 70848 |
| Euler totient φ(n) | 43120 |
| Square | 3188296225 |
| Cube | 180027146344625 |
| Square root | 237.623652 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.6465 × |
56465 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand four hundred and sixty-five |
| Binary (base 2) | 1101110010010001 |
| Octal (base 8) | 156221 |
| Hexadecimal (base 16) | DC91 |
| Base 3 | 2212110022 |
| As time | 56465 seconds = 15 h 41 min 5 s |
Is 56465 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 | Yes (56465 ÷ 5 = 11293) | 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 | No (remainder 3) | 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 5) | 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 56465 a prime number?
No. 56465 = 5 × 23 × 491, so it is divisible by 5.
What are the factors of 56465?
1, 5, 23, 115, 491, 2455, 11293, 56465.
What is 56465 in binary?
1101110010010001 (hexadecimal DC91, octal 156221).
What is the square root of 56465?
About 237.6237.
Is 56465 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 56465?
56465 is a palindrome: it reads 56465 backwards too.