The number 14364
14364 is a composite number with 48 divisors. Its prime factorisation is × × 7 × 19. Divisors (48): 1, 2, 3, 4, 6, 7, 9, 12, 14, 18, 19, 21, 27, 28, 36, 38 … 14364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14364: a Harshad number: divisible by its digit sum 18.
- 2
14364 is composite. Its prime factorisation is
- 3
The divisors add up to 44800; without 14364 itself that is 30436, so 14364 is abundant (30436 is more than 14364). Euler's totient φ(14364) = 3888 numbers up to 14364 share no factor with it.
- 4
The digits of 14364 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 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14364 = 2^{2} \times 3^{3} \times 7 \times 19 \]14364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 44800 |
| Euler totient φ(n) | 3888 |
| Square | 206324496 |
| Cube | 2963645060544 |
| Square root | 119.849906 (= 6√399) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 151 |
| Scientific notation | 1.4364 × |
14364 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand three hundred and sixty-four |
| Binary (base 2) | 11100000011100 |
| Octal (base 8) | 34034 |
| Hexadecimal (base 16) | 381C |
| Base 3 | 201201000 |
| As time | 14364 seconds = 3 h 59 min 24 s |
Is 14364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14364 ÷ 2 = 7182) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14364 ÷ 3 = 4788) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (14364 ÷ 4 = 3591) | 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 (14364 ÷ 6 = 2394) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (14364 ÷ 7 = 2052) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (14364 ÷ 9 = 1596) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (14364 ÷ 12 = 1197) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14364 a prime number?
No. 14364 = × × 7 × 19, so it is divisible by 2.
What are the factors of 14364?
1, 2, 3, 4, 6, 7, 9, 12, 14, 18, 19, 21, 27, 28, 36, 38, 42, 54, 57, 63, 76, 84, 108, 114, 126, 133, 171, 189, 228, 252, 266, 342, 378, 399, 513, 532, 684, 756, 798, 1026, 1197, 1596, 2052, 2394, 3591, 4788, 7182, 14364.
What is 14364 in binary?
11100000011100 (hexadecimal 381C, octal 34034).
What is the square root of 14364?
About 119.8499, exactly 6√399.
Is 14364 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 14364?
14364 is a Harshad number: divisible by its digit sum 18.