The number 15707
15707 is a composite number with 4 divisors. Its prime factorisation is 113 × 139. Divisors (4): 1, 113, 139, 15707.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15707: a semiprime: 113 × 139, the product of two primes.
- 2
15707 is composite. Its prime factorisation is
- 3
The divisors add up to 15960; without 15707 itself that is 253, so 15707 is deficient (253 is less than 15707). Euler's totient φ(15707) = 15456 numbers up to 15707 share no factor with it.
- 4
The digits of 15707 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15707 = 113 \times 139 \]
15707 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15960 |
| Euler totient φ(n) | 15456 |
| Square | 246709849 |
| Cube | 3875071598243 |
| Square root | 125.327571 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5707 × |
15707 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand seven hundred and seven |
| Binary (base 2) | 11110101011011 |
| Octal (base 8) | 36533 |
| Hexadecimal (base 16) | 3D5B |
| Base 3 | 210112202 |
| As time | 15707 seconds = 4 h 21 min 47 s |
Is 15707 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 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 5) | 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 3) | 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 7) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15707 a prime number?
No. 15707 = 113 × 139, so it is divisible by 113.
What are the factors of 15707?
1, 113, 139, 15707.
What is 15707 in binary?
11110101011011 (hexadecimal 3D5B, octal 36533).
What is the square root of 15707?
About 125.3276.
Is 15707 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 15707?
15707 is a semiprime: 113 × 139, the product of two primes.