The number 14707
14707 is a composite number with 8 divisors. Its prime factorisation is 7 × 11 × 191. Divisors (8): 1, 7, 11, 77, 191, 1337, 2101, 14707.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14707 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14707 is composite. Its prime factorisation is
- 3
The divisors add up to 18432; without 14707 itself that is 3725, so 14707 is deficient (3725 is less than 14707). Euler's totient φ(14707) = 11400 numbers up to 14707 share no factor with it.
- 4
The digits of 14707 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14707 = 7 \times 11 \times 191 \]
14707 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18432 |
| Euler totient φ(n) | 11400 |
| Square | 216295849 |
| Cube | 3181063051243 |
| Square root | 121.272421 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 164 |
| Scientific notation | 1.4707 × |
14707 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand seven hundred and seven |
| Binary (base 2) | 11100101110011 |
| Octal (base 8) | 34563 |
| Hexadecimal (base 16) | 3973 |
| Base 3 | 202011201 |
| As time | 14707 seconds = 4 h 5 min 7 s |
Is 14707 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (14707 ÷ 7 = 2101) | 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 1) | 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 | Yes (14707 ÷ 11 = 1337) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14707 a prime number?
No. 14707 = 7 × 11 × 191, so it is divisible by 7.
What are the factors of 14707?
1, 7, 11, 77, 191, 1337, 2101, 14707.
What is 14707 in binary?
11100101110011 (hexadecimal 3973, octal 34563).
What is the square root of 14707?
About 121.2724.
Is 14707 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 14707?
It is a composite number with 8 divisors.