The number 14370
14370 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 479. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 479, 958, 1437, 2395, 2874, 4790, 7185, 14370.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14370: a Harshad number: divisible by its digit sum 15.
- 2
14370 is composite. Its prime factorisation is
- 3
The divisors add up to 34560; without 14370 itself that is 20190, so 14370 is abundant (20190 is more than 14370). Euler's totient φ(14370) = 3824 numbers up to 14370 share no factor with it.
- 4
The digits of 14370 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 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14370 = 2 \times 3 \times 5 \times 479 \]
14370 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 34560 |
| Euler totient φ(n) | 3824 |
| Square | 206496900 |
| Cube | 2967360453000 |
| Square root | 119.874935 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.437 × |
14370 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand three hundred and seventy |
| Binary (base 2) | 11100000100010 |
| Octal (base 8) | 34042 |
| Hexadecimal (base 16) | 3822 |
| Base 3 | 201201020 |
| As time | 14370 seconds = 3 h 59 min 30 s |
Is 14370 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14370 ÷ 2 = 7185) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14370 ÷ 3 = 4790) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (14370 ÷ 5 = 2874) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (14370 ÷ 6 = 2395) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 2) | 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 | Yes (14370 ÷ 10 = 1437) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14370 a prime number?
No. 14370 = 2 × 3 × 5 × 479, so it is divisible by 2.
What are the factors of 14370?
1, 2, 3, 5, 6, 10, 15, 30, 479, 958, 1437, 2395, 2874, 4790, 7185, 14370.
What is 14370 in binary?
11100000100010 (hexadecimal 3822, octal 34042).
What is the square root of 14370?
About 119.8749.
Is 14370 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 14370?
14370 is a Harshad number: divisible by its digit sum 15.