The number 56005
56005 is a composite number with 8 divisors. Its prime factorisation is 5 × 23 × 487. Divisors (8): 1, 5, 23, 115, 487, 2435, 11201, 56005.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56005: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
56005 is composite. Its prime factorisation is
- 3
The divisors add up to 70272; without 56005 itself that is 14267, so 56005 is deficient (14267 is less than 56005). Euler's totient φ(56005) = 42768 numbers up to 56005 share no factor with it.
- 4
The digits of 56005 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56005 = 5 \times 23 \times 487 \]
56005 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 70272 |
| Euler totient φ(n) | 42768 |
| Square | 3136560025 |
| Cube | 175663044200125 |
| Square root | 236.653756 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 34 |
| Scientific notation | 5.6005 × |
56005 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and five |
| Binary (base 2) | 1101101011000101 |
| Octal (base 8) | 155305 |
| Hexadecimal (base 16) | DAC5 |
| Base 3 | 2211211021 |
| As time | 56005 seconds = 15 h 33 min 25 s |
Is 56005 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 (56005 ÷ 5 = 11201) | 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 5) | 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 7) | 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 4) | 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 56005 a prime number?
No. 56005 = 5 × 23 × 487, so it is divisible by 5.
What are the factors of 56005?
1, 5, 23, 115, 487, 2435, 11201, 56005.
What is 56005 in binary?
1101101011000101 (hexadecimal DAC5, octal 155305).
What is the square root of 56005?
About 236.6538.
Is 56005 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 56005?
56005 is a happy number: repeatedly adding the squares of its digits reaches 1.