The number 56065
56065 is a palindrome: it reads 56065 backwards too. Its prime factorisation is 5 × 11213. Divisors (4): 1, 5, 11213, 56065.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56065: a palindrome: it reads 56065 backwards too; a semiprime: 5 × 11213, the product of two primes.
- 2
56065 is composite. Its prime factorisation is
- 3
The divisors add up to 67284; without 56065 itself that is 11219, so 56065 is deficient (11219 is less than 56065). Euler's totient φ(56065) = 44848 numbers up to 56065 share no factor with it.
- 4
The digits of 56065 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56065 = 5 \times 11213 \]
56065 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 67284 |
| Euler totient φ(n) | 44848 |
| Square | 3143284225 |
| Cube | 176228230074625 |
| Square root | 236.780489 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.6065 × |
56065 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and sixty-five |
| Binary (base 2) | 1101101100000001 |
| Octal (base 8) | 155401 |
| Hexadecimal (base 16) | DB01 |
| Base 3 | 2211220111 |
| As time | 56065 seconds = 15 h 34 min 25 s |
Is 56065 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 | Yes (56065 ÷ 5 = 11213) | 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 | No (remainder 2) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 56065 a prime number?
No. 56065 = 5 × 11213, so it is divisible by 5.
What are the factors of 56065?
1, 5, 11213, 56065.
What is 56065 in binary?
1101101100000001 (hexadecimal DB01, octal 155401).
What is the square root of 56065?
About 236.7805.
Is 56065 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 56065?
56065 is a palindrome: it reads 56065 backwards too; a semiprime: 5 × 11213, the product of two primes.