The number 56066
56066 is a composite number with 12 divisors. Its prime factorisation is 2 × × 97. Divisors (12): 1, 2, 17, 34, 97, 194, 289, 578, 1649, 3298, 28033, 56066.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56066: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
56066 is composite. Its prime factorisation is
- 3
The divisors add up to 90258; without 56066 itself that is 34192, so 56066 is deficient (34192 is less than 56066). Euler's totient φ(56066) = 26112 numbers up to 56066 share no factor with it.
- 4
The digits of 56066 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56066 = 2 \times 17^{2} \times 97 \]56066 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 90258 |
| Euler totient φ(n) | 26112 |
| Square | 3143396356 |
| Cube | 176237660095496 |
| Square root | 236.782601 (= 17√194) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.6066 × |
56066 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and sixty-six |
| Binary (base 2) | 1101101100000010 |
| Octal (base 8) | 155402 |
| Hexadecimal (base 16) | DB02 |
| Base 3 | 2211220112 |
| As time | 56066 seconds = 15 h 34 min 26 s |
Is 56066 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56066 ÷ 2 = 28033) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 10) | 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 56066 a prime number?
No. 56066 = 2 × × 97, so it is divisible by 2.
What are the factors of 56066?
1, 2, 17, 34, 97, 194, 289, 578, 1649, 3298, 28033, 56066.
What is 56066 in binary?
1101101100000010 (hexadecimal DB02, octal 155402).
What is the square root of 56066?
About 236.7826, exactly 17√194.
Is 56066 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 56066?
56066 is a happy number: repeatedly adding the squares of its digits reaches 1.