The number 5601
5601 is a composite number with 4 divisors. Its prime factorisation is 3 × 1867. Divisors (4): 1, 3, 1867, 5601.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5601: a semiprime: 3 × 1867, the product of two primes.
- 2
5601 is composite. Its prime factorisation is
- 3
The divisors add up to 7472; without 5601 itself that is 1871, so 5601 is deficient (1871 is less than 5601). Euler's totient φ(5601) = 3732 numbers up to 5601 share no factor with it.
- 4
The digits of 5601 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 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5601 = 3 \times 1867 \]
5601 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 7472 |
| Euler totient φ(n) | 3732 |
| Square | 31371201 |
| Cube | 175710096801 |
| Square root | 74.839829 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 67 |
| Scientific notation | 5.601 × |
5601 in other forms
| Form | Value |
|---|---|
| In words | five thousand six hundred and one |
| Binary (base 2) | 1010111100001 |
| Octal (base 8) | 12741 |
| Hexadecimal (base 16) | 15E1 |
| Base 3 | 21200110 |
| As time | 5601 seconds = 1 h 33 min 21 s |
Is 5601 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 (5601 ÷ 3 = 1867) | 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 | No (remainder 2) | 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 5601 a prime number?
No. 5601 = 3 × 1867, so it is divisible by 3.
What are the factors of 5601?
1, 3, 1867, 5601.
What is 5601 in binary?
1010111100001 (hexadecimal 15E1, octal 12741).
What is the square root of 5601?
About 74.8398.
Is 5601 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 5601?
5601 is a semiprime: 3 × 1867, the product of two primes.