The number 13701
13701 is a composite number with 4 divisors. Its prime factorisation is 3 × 4567. Divisors (4): 1, 3, 4567, 13701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13701: a semiprime: 3 × 4567, the product of two primes.
- 2
13701 is composite. Its prime factorisation is
- 3
The divisors add up to 18272; without 13701 itself that is 4571, so 13701 is deficient (4571 is less than 13701). Euler's totient φ(13701) = 9132 numbers up to 13701 share no factor with it.
- 4
The digits of 13701 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 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13701 = 3 \times 4567 \]
13701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 18272 |
| Euler totient φ(n) | 9132 |
| Square | 187717401 |
| Cube | 2571916111101 |
| Square root | 117.051271 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.3701 × |
13701 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand seven hundred and one |
| Binary (base 2) | 11010110000101 |
| Octal (base 8) | 32605 |
| Hexadecimal (base 16) | 3585 |
| Base 3 | 200210110 |
| As time | 13701 seconds = 3 h 48 min 21 s |
Is 13701 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 (13701 ÷ 3 = 4567) | 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 2) | 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 5) | 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 6) | 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 13701 a prime number?
No. 13701 = 3 × 4567, so it is divisible by 3.
What are the factors of 13701?
1, 3, 4567, 13701.
What is 13701 in binary?
11010110000101 (hexadecimal 3585, octal 32605).
What is the square root of 13701?
About 117.0513.
Is 13701 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 13701?
13701 is a semiprime: 3 × 4567, the product of two primes.