The number 14487
14487 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 439. Divisors (8): 1, 3, 11, 33, 439, 1317, 4829, 14487.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14487 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14487 is composite. Its prime factorisation is
- 3
The divisors add up to 21120; without 14487 itself that is 6633, so 14487 is deficient (6633 is less than 14487). Euler's totient φ(14487) = 8760 numbers up to 14487 share no factor with it.
- 4
The digits of 14487 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14487 = 3 \times 11 \times 439 \]
14487 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 21120 |
| Euler totient φ(n) | 8760 |
| Square | 209873169 |
| Cube | 3040432599303 |
| Square root | 120.361954 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.4487 × |
14487 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand four hundred and eighty-seven |
| Binary (base 2) | 11100010010111 |
| Octal (base 8) | 34227 |
| Hexadecimal (base 16) | 3897 |
| Base 3 | 201212120 |
| As time | 14487 seconds = 4 h 1 min 27 s |
Is 14487 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 (14487 ÷ 3 = 4829) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (14487 ÷ 11 = 1317) | 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 14487 a prime number?
No. 14487 = 3 × 11 × 439, so it is divisible by 3.
What are the factors of 14487?
1, 3, 11, 33, 439, 1317, 4829, 14487.
What is 14487 in binary?
11100010010111 (hexadecimal 3897, octal 34227).
What is the square root of 14487?
About 120.3620.
Is 14487 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 14487?
It is a composite number with 8 divisors.