The number 14703
14703 is a composite number with 12 divisors. Its prime factorisation is 3 × × 29. Divisors (12): 1, 3, 13, 29, 39, 87, 169, 377, 507, 1131, 4901, 14703.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14703 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14703 is composite. Its prime factorisation is
- 3
The divisors add up to 21960; without 14703 itself that is 7257, so 14703 is deficient (7257 is less than 14703). Euler's totient φ(14703) = 8736 numbers up to 14703 share no factor with it.
- 4
The digits of 14703 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 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14703 = 3 \times 13^{2} \times 29 \]14703 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 21960 |
| Euler totient φ(n) | 8736 |
| Square | 216178209 |
| Cube | 3178468206927 |
| Square root | 121.255928 (= 13√87) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 102 |
| Scientific notation | 1.4703 × |
14703 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand seven hundred and three |
| Binary (base 2) | 11100101101111 |
| Octal (base 8) | 34557 |
| Hexadecimal (base 16) | 396F |
| Base 3 | 202011120 |
| As time | 14703 seconds = 4 h 5 min 3 s |
Is 14703 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 (14703 ÷ 3 = 4901) | 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 3) | 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 3) | 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 7) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14703 a prime number?
No. 14703 = 3 × × 29, so it is divisible by 3.
What are the factors of 14703?
1, 3, 13, 29, 39, 87, 169, 377, 507, 1131, 4901, 14703.
What is 14703 in binary?
11100101101111 (hexadecimal 396F, octal 34557).
What is the square root of 14703?
About 121.2559, exactly 13√87.
Is 14703 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 14703?
It is a composite number with 12 divisors.