The number 14064
14064 is a composite number with 20 divisors. Its prime factorisation is × 3 × 293. Divisors (20): 1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 293, 586, 879, 1172, 1758, 2344 … 14064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14064 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14064 is composite. Its prime factorisation is
- 3
The divisors add up to 36456; without 14064 itself that is 22392, so 14064 is abundant (22392 is more than 14064). Euler's totient φ(14064) = 4672 numbers up to 14064 share no factor with it.
- 4
The digits of 14064 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 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14064 = 2^{4} \times 3 \times 293 \]14064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 36456 |
| Euler totient φ(n) | 4672 |
| Square | 197796096 |
| Cube | 2781804294144 |
| Square root | 118.591737 (= 4√879) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 151 |
| Scientific notation | 1.4064 × |
14064 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand and sixty-four |
| Binary (base 2) | 11011011110000 |
| Octal (base 8) | 33360 |
| Hexadecimal (base 16) | 36F0 |
| Base 3 | 201021220 |
| As time | 14064 seconds = 3 h 54 min 24 s |
Is 14064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14064 ÷ 2 = 7032) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14064 ÷ 3 = 4688) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (14064 ÷ 4 = 3516) | 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 | Yes (14064 ÷ 6 = 2344) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | Yes (14064 ÷ 8 = 1758) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (14064 ÷ 12 = 1172) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14064 a prime number?
No. 14064 = × 3 × 293, so it is divisible by 2.
What are the factors of 14064?
1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 293, 586, 879, 1172, 1758, 2344, 3516, 4688, 7032, 14064.
What is 14064 in binary?
11011011110000 (hexadecimal 36F0, octal 33360).
What is the square root of 14064?
About 118.5917, exactly 4√879.
Is 14064 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 14064?
It is a composite number with 20 divisors.