The number 14330
14330 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1433. Divisors (8): 1, 2, 5, 10, 1433, 2866, 7165, 14330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14330 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14330 is composite. Its prime factorisation is
- 3
The divisors add up to 25812; without 14330 itself that is 11482, so 14330 is deficient (11482 is less than 14330). Euler's totient φ(14330) = 5728 numbers up to 14330 share no factor with it.
- 4
The digits of 14330 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14330 = 2 \times 5 \times 1433 \]
14330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 25812 |
| Euler totient φ(n) | 5728 |
| Square | 205348900 |
| Cube | 2942649737000 |
| Square root | 119.707978 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 102 |
| Scientific notation | 1.433 × |
14330 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand three hundred and thirty |
| Binary (base 2) | 11011111111010 |
| Octal (base 8) | 33772 |
| Hexadecimal (base 16) | 37FA |
| Base 3 | 201122202 |
| As time | 14330 seconds = 3 h 58 min 50 s |
Is 14330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14330 ÷ 2 = 7165) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 (14330 ÷ 5 = 2866) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 | No (remainder 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (14330 ÷ 10 = 1433) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14330 a prime number?
No. 14330 = 2 × 5 × 1433, so it is divisible by 2.
What are the factors of 14330?
1, 2, 5, 10, 1433, 2866, 7165, 14330.
What is 14330 in binary?
11011111111010 (hexadecimal 37FA, octal 33772).
What is the square root of 14330?
About 119.7080.
Is 14330 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 14330?
It is a composite number with 8 divisors.