The number 56006
56006 is a composite number with 8 divisors. Its prime factorisation is 2 × 41 × 683. Divisors (8): 1, 2, 41, 82, 683, 1366, 28003, 56006.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56006: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
56006 is composite. Its prime factorisation is
- 3
The divisors add up to 86184; without 56006 itself that is 30178, so 56006 is deficient (30178 is less than 56006). Euler's totient φ(56006) = 27280 numbers up to 56006 share no factor with it.
- 4
The digits of 56006 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56006 = 2 \times 41 \times 683 \]
56006 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 86184 |
| Euler totient φ(n) | 27280 |
| Square | 3136672036 |
| Cube | 175672454048216 |
| Square root | 236.655868 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 34 |
| Scientific notation | 5.6006 × |
56006 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and six |
| Binary (base 2) | 1101101011000110 |
| Octal (base 8) | 155306 |
| Hexadecimal (base 16) | DAC6 |
| Base 3 | 2211211022 |
| As time | 56006 seconds = 15 h 33 min 26 s |
Is 56006 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56006 ÷ 2 = 28003) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 6) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56006 a prime number?
No. 56006 = 2 × 41 × 683, so it is divisible by 2.
What are the factors of 56006?
1, 2, 41, 82, 683, 1366, 28003, 56006.
What is 56006 in binary?
1101101011000110 (hexadecimal DAC6, octal 155306).
What is the square root of 56006?
About 236.6559.
Is 56006 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 56006?
56006 is a happy number: repeatedly adding the squares of its digits reaches 1.