The number 13705
13705 is a composite number with 4 divisors. Its prime factorisation is 5 × 2741. Divisors (4): 1, 5, 2741, 13705.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13705: a semiprime: 5 × 2741, the product of two primes.
- 2
13705 is composite. Its prime factorisation is
- 3
The divisors add up to 16452; without 13705 itself that is 2747, so 13705 is deficient (2747 is less than 13705). Euler's totient φ(13705) = 10960 numbers up to 13705 share no factor with it.
- 4
The digits of 13705 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13705 = 5 \times 2741 \]
13705 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16452 |
| Euler totient φ(n) | 10960 |
| Square | 187827025 |
| Cube | 2574169377625 |
| Square root | 117.068356 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 151 |
| Scientific notation | 1.3705 × |
13705 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand seven hundred and five |
| Binary (base 2) | 11010110001001 |
| Octal (base 8) | 32611 |
| Hexadecimal (base 16) | 3589 |
| Base 3 | 200210121 |
| As time | 13705 seconds = 3 h 48 min 25 s |
Is 13705 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 1) | 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 | Yes (13705 ÷ 5 = 2741) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13705 a prime number?
No. 13705 = 5 × 2741, so it is divisible by 5.
What are the factors of 13705?
1, 5, 2741, 13705.
What is 13705 in binary?
11010110001001 (hexadecimal 3589, octal 32611).
What is the square root of 13705?
About 117.0684.
Is 13705 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 13705?
13705 is a semiprime: 5 × 2741, the product of two primes.