The number 15705
15705 is a composite number with 12 divisors. Its prime factorisation is × 5 × 349. Divisors (12): 1, 3, 5, 9, 15, 45, 349, 1047, 1745, 3141, 5235, 15705.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15705: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
15705 is composite. Its prime factorisation is
- 3
The divisors add up to 27300; without 15705 itself that is 11595, so 15705 is deficient (11595 is less than 15705). Euler's totient φ(15705) = 8352 numbers up to 15705 share no factor with it.
- 4
The digits of 15705 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 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15705 = 3^{2} \times 5 \times 349 \]15705 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 27300 |
| Euler totient φ(n) | 8352 |
| Square | 246647025 |
| Cube | 3873591527625 |
| Square root | 125.319591 (= 3√1745) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 102 |
| Scientific notation | 1.5705 × |
15705 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand seven hundred and five |
| Binary (base 2) | 11110101011001 |
| Octal (base 8) | 36531 |
| Hexadecimal (base 16) | 3D59 |
| Base 3 | 210112200 |
| As time | 15705 seconds = 4 h 21 min 45 s |
Is 15705 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 (15705 ÷ 3 = 5235) | 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 (15705 ÷ 5 = 3141) | 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 4) | 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 | Yes (15705 ÷ 9 = 1745) | 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 8) | 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 15705 a prime number?
No. 15705 = × 5 × 349, so it is divisible by 3.
What are the factors of 15705?
1, 3, 5, 9, 15, 45, 349, 1047, 1745, 3141, 5235, 15705.
What is 15705 in binary?
11110101011001 (hexadecimal 3D59, octal 36531).
What is the square root of 15705?
About 125.3196, exactly 3√1745.
Is 15705 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 15705?
15705 is a happy number: repeatedly adding the squares of its digits reaches 1.