The number 56001
56001 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 1697. Divisors (8): 1, 3, 11, 33, 1697, 5091, 18667, 56001.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56001 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56001 is composite. Its prime factorisation is
- 3
The divisors add up to 81504; without 56001 itself that is 25503, so 56001 is deficient (25503 is less than 56001). Euler's totient φ(56001) = 33920 numbers up to 56001 share no factor with it.
- 4
The digits of 56001 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56001 = 3 \times 11 \times 1697 \]
56001 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 81504 |
| Euler totient φ(n) | 33920 |
| Square | 3136112001 |
| Cube | 175625408168001 |
| Square root | 236.645304 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.6001 × |
56001 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and one |
| Binary (base 2) | 1101101011000001 |
| Octal (base 8) | 155301 |
| Hexadecimal (base 16) | DAC1 |
| Base 3 | 2211211010 |
| As time | 56001 seconds = 15 h 33 min 21 s |
Is 56001 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 (56001 ÷ 3 = 18667) | 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 | No (remainder 1) | 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 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (56001 ÷ 11 = 5091) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56001 a prime number?
No. 56001 = 3 × 11 × 1697, so it is divisible by 3.
What are the factors of 56001?
1, 3, 11, 33, 1697, 5091, 18667, 56001.
What is 56001 in binary?
1101101011000001 (hexadecimal DAC1, octal 155301).
What is the square root of 56001?
About 236.6453.
Is 56001 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 56001?
It is a composite number with 8 divisors.