The number 14709
14709 is a composite number with 4 divisors. Its prime factorisation is 3 × 4903. Divisors (4): 1, 3, 4903, 14709.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14709: a semiprime: 3 × 4903, the product of two primes.
- 2
14709 is composite. Its prime factorisation is
- 3
The divisors add up to 19616; without 14709 itself that is 4907, so 14709 is deficient (4907 is less than 14709). Euler's totient φ(14709) = 9804 numbers up to 14709 share no factor with it.
- 4
The digits of 14709 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14709 = 3 \times 4903 \]
14709 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 19616 |
| Euler totient φ(n) | 9804 |
| Square | 216354681 |
| Cube | 3182361002829 |
| Square root | 121.280666 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.4709 × |
14709 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand seven hundred and nine |
| Binary (base 2) | 11100101110101 |
| Octal (base 8) | 34565 |
| Hexadecimal (base 16) | 3975 |
| Base 3 | 202011210 |
| As time | 14709 seconds = 4 h 5 min 9 s |
Is 14709 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 (14709 ÷ 3 = 4903) | 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 | No (remainder 4) | 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 2) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 14709 a prime number?
No. 14709 = 3 × 4903, so it is divisible by 3.
What are the factors of 14709?
1, 3, 4903, 14709.
What is 14709 in binary?
11100101110101 (hexadecimal 3975, octal 34565).
What is the square root of 14709?
About 121.2807.
Is 14709 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 14709?
14709 is a semiprime: 3 × 4903, the product of two primes.