The number 56067
56067 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 1699. Divisors (8): 1, 3, 11, 33, 1699, 5097, 18689, 56067.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56067 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56067 is composite. Its prime factorisation is
- 3
The divisors add up to 81600; without 56067 itself that is 25533, so 56067 is deficient (25533 is less than 56067). Euler's totient φ(56067) = 33960 numbers up to 56067 share no factor with it.
- 4
The digits of 56067 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56067 = 3 \times 11 \times 1699 \]
56067 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 81600 |
| Euler totient φ(n) | 33960 |
| Square | 3143508489 |
| Cube | 176247090452763 |
| Square root | 236.784712 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.6067 × |
56067 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and sixty-seven |
| Binary (base 2) | 1101101100000011 |
| Octal (base 8) | 155403 |
| Hexadecimal (base 16) | DB03 |
| Base 3 | 2211220120 |
| As time | 56067 seconds = 15 h 34 min 27 s |
Is 56067 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 | Yes (56067 ÷ 3 = 18689) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (56067 ÷ 11 = 5097) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56067 a prime number?
No. 56067 = 3 × 11 × 1699, so it is divisible by 3.
What are the factors of 56067?
1, 3, 11, 33, 1699, 5097, 18689, 56067.
What is 56067 in binary?
1101101100000011 (hexadecimal DB03, octal 155403).
What is the square root of 56067?
About 236.7847.
Is 56067 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 56067?
It is a composite number with 8 divisors.