The number 56965
56965 is a palindrome: it reads 56965 backwards too. Its prime factorisation is 5 × 11393. Divisors (4): 1, 5, 11393, 56965.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56965: a palindrome: it reads 56965 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 11393, the product of two primes.
- 2
56965 is composite. Its prime factorisation is
- 3
The divisors add up to 68364; without 56965 itself that is 11399, so 56965 is deficient (11399 is less than 56965). Euler's totient φ(56965) = 45568 numbers up to 56965 share no factor with it.
- 4
The digits of 56965 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56965 = 5 \times 11393 \]
56965 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 68364 |
| Euler totient φ(n) | 45568 |
| Square | 3245011225 |
| Cube | 184852064432125 |
| Square root | 238.673417 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.6965 × |
56965 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and sixty-five |
| Binary (base 2) | 1101111010000101 |
| Octal (base 8) | 157205 |
| Hexadecimal (base 16) | DE85 |
| Base 3 | 2220010211 |
| As time | 56965 seconds = 15 h 49 min 25 s |
Is 56965 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 (56965 ÷ 5 = 11393) | 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 6) | 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 5) | 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 7) | 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 56965 a prime number?
No. 56965 = 5 × 11393, so it is divisible by 5.
What are the factors of 56965?
1, 5, 11393, 56965.
What is 56965 in binary?
1101111010000101 (hexadecimal DE85, octal 157205).
What is the square root of 56965?
About 238.6734.
Is 56965 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 56965?
56965 is a palindrome: it reads 56965 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 11393, the product of two primes.