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