The number 13601
13601 is a composite number with 8 divisors. Its prime factorisation is 7 × 29 × 67. Divisors (8): 1, 7, 29, 67, 203, 469, 1943, 13601.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13601 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13601 is composite. Its prime factorisation is
- 3
The divisors add up to 16320; without 13601 itself that is 2719, so 13601 is deficient (2719 is less than 13601). Euler's totient φ(13601) = 11088 numbers up to 13601 share no factor with it.
- 4
The digits of 13601 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13601 = 7 \times 29 \times 67 \]
13601 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 16320 |
| Euler totient φ(n) | 11088 |
| Square | 184987201 |
| Cube | 2516010920801 |
| Square root | 116.623325 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.3601 × |
13601 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand six hundred and one |
| Binary (base 2) | 11010100100001 |
| Octal (base 8) | 32441 |
| Hexadecimal (base 16) | 3521 |
| Base 3 | 200122202 |
| As time | 13601 seconds = 3 h 46 min 41 s |
Is 13601 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 | No (remainder 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (13601 ÷ 7 = 1943) | 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 2) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13601 a prime number?
No. 13601 = 7 × 29 × 67, so it is divisible by 7.
What are the factors of 13601?
1, 7, 29, 67, 203, 469, 1943, 13601.
What is 13601 in binary?
11010100100001 (hexadecimal 3521, octal 32441).
What is the square root of 13601?
About 116.6233.
Is 13601 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 13601?
It is a composite number with 8 divisors.