The number 21705
21705 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 1447. Divisors (8): 1, 3, 5, 15, 1447, 4341, 7235, 21705.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 21705: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 15.
- 2
21705 is composite. Its prime factorisation is
- 3
The divisors add up to 34752; without 21705 itself that is 13047, so 21705 is deficient (13047 is less than 21705). Euler's totient φ(21705) = 11568 numbers up to 21705 share no factor with it.
- 4
The digits of 21705 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 118 steps to reach 1.
LaTeX source of the formulas on this page
\[ 21705 = 3 \times 5 \times 1447 \]
21705 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 34752 |
| Euler totient φ(n) | 11568 |
| Square | 471107025 |
| Cube | 10225377977625 |
| Square root | 147.326169 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 118 |
| Scientific notation | 2.1705 × |
21705 in other forms
| Form | Value |
|---|---|
| In words | twenty-one thousand seven hundred and five |
| Binary (base 2) | 101010011001001 |
| Octal (base 8) | 52311 |
| Hexadecimal (base 16) | 54C9 |
| Base 3 | 1002202220 |
| As time | 21705 seconds = 6 h 1 min 45 s |
Is 21705 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 (21705 ÷ 3 = 7235) | 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 (21705 ÷ 5 = 4341) | 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 5) | 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 6) | 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 2) | 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 21705 a prime number?
No. 21705 = 3 × 5 × 1447, so it is divisible by 3.
What are the factors of 21705?
1, 3, 5, 15, 1447, 4341, 7235, 21705.
What is 21705 in binary?
101010011001001 (hexadecimal 54C9, octal 52311).
What is the square root of 21705?
About 147.3262.
Is 21705 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 21705?
21705 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 15.