The number 14705
14705 is a composite number with 8 divisors. Its prime factorisation is 5 × 17 × 173. Divisors (8): 1, 5, 17, 85, 173, 865, 2941, 14705.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14705: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17.
- 2
14705 is composite. Its prime factorisation is
- 3
The divisors add up to 18792; without 14705 itself that is 4087, so 14705 is deficient (4087 is less than 14705). Euler's totient φ(14705) = 11008 numbers up to 14705 share no factor with it.
- 4
The digits of 14705 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14705 = 5 \times 17 \times 173 \]
14705 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18792 |
| Euler totient φ(n) | 11008 |
| Square | 216237025 |
| Cube | 3179765452625 |
| Square root | 121.264174 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.4705 × |
14705 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand seven hundred and five |
| Binary (base 2) | 11100101110001 |
| Octal (base 8) | 34561 |
| Hexadecimal (base 16) | 3971 |
| Base 3 | 202011122 |
| As time | 14705 seconds = 4 h 5 min 5 s |
Is 14705 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (14705 ÷ 5 = 2941) | 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 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 8) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14705 a prime number?
No. 14705 = 5 × 17 × 173, so it is divisible by 5.
What are the factors of 14705?
1, 5, 17, 85, 173, 865, 2941, 14705.
What is 14705 in binary?
11100101110001 (hexadecimal 3971, octal 34561).
What is the square root of 14705?
About 121.2642.
Is 14705 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 14705?
14705 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17.