The number 13707
13707 is a composite number with 6 divisors. Its prime factorisation is × 1523. Divisors (6): 1, 3, 9, 1523, 4569, 13707.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13707 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13707 is composite. Its prime factorisation is
- 3
The divisors add up to 19812; without 13707 itself that is 6105, so 13707 is deficient (6105 is less than 13707). Euler's totient φ(13707) = 9132 numbers up to 13707 share no factor with it.
- 4
The digits of 13707 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13707 = 3^{2} \times 1523 \]13707 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 19812 |
| Euler totient φ(n) | 9132 |
| Square | 187881849 |
| Cube | 2575296504243 |
| Square root | 117.076898 (= 3√1523) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.3707 × |
13707 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand seven hundred and seven |
| Binary (base 2) | 11010110001011 |
| Octal (base 8) | 32613 |
| Hexadecimal (base 16) | 358B |
| Base 3 | 200210200 |
| As time | 13707 seconds = 3 h 48 min 27 s |
Is 13707 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 (13707 ÷ 3 = 4569) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (13707 ÷ 9 = 1523) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13707 a prime number?
No. 13707 = × 1523, so it is divisible by 3.
What are the factors of 13707?
1, 3, 9, 1523, 4569, 13707.
What is 13707 in binary?
11010110001011 (hexadecimal 358B, octal 32613).
What is the square root of 13707?
About 117.0769, exactly 3√1523.
Is 13707 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 13707?
It is a composite number with 6 divisors.