The number 14481
14481 is a composite number with 6 divisors. Its prime factorisation is × 1609. Divisors (6): 1, 3, 9, 1609, 4827, 14481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14481 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14481 is composite. Its prime factorisation is
- 3
The divisors add up to 20930; without 14481 itself that is 6449, so 14481 is deficient (6449 is less than 14481). Euler's totient φ(14481) = 9648 numbers up to 14481 share no factor with it.
- 4
The digits of 14481 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14481 = 3^{2} \times 1609 \]14481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 20930 |
| Euler totient φ(n) | 9648 |
| Square | 209699361 |
| Cube | 3036656446641 |
| Square root | 120.337027 (= 3√1609) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 102 |
| Scientific notation | 1.4481 × |
14481 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand four hundred and eighty-one |
| Binary (base 2) | 11100010010001 |
| Octal (base 8) | 34221 |
| Hexadecimal (base 16) | 3891 |
| Base 3 | 201212100 |
| As time | 14481 seconds = 4 h 1 min 21 s |
Is 14481 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 (14481 ÷ 3 = 4827) | 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 1) | 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 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 | Yes (14481 ÷ 9 = 1609) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 14481 a prime number?
No. 14481 = × 1609, so it is divisible by 3.
What are the factors of 14481?
1, 3, 9, 1609, 4827, 14481.
What is 14481 in binary?
11100010010001 (hexadecimal 3891, octal 34221).
What is the square root of 14481?
About 120.3370, exactly 3√1609.
Is 14481 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 14481?
It is a composite number with 6 divisors.