The number 14555
14555 is a composite number with 8 divisors. Its prime factorisation is 5 × 41 × 71. Divisors (8): 1, 5, 41, 71, 205, 355, 2911, 14555.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14555 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14555 is composite. Its prime factorisation is
- 3
The divisors add up to 18144; without 14555 itself that is 3589, so 14555 is deficient (3589 is less than 14555). Euler's totient φ(14555) = 11200 numbers up to 14555 share no factor with it.
- 4
The digits of 14555 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14555 = 5 \times 41 \times 71 \]
14555 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18144 |
| Euler totient φ(n) | 11200 |
| Square | 211848025 |
| Cube | 3083448003875 |
| Square root | 120.644105 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.4555 × |
14555 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand five hundred and fifty-five |
| Binary (base 2) | 11100011011011 |
| Octal (base 8) | 34333 |
| Hexadecimal (base 16) | 38DB |
| Base 3 | 201222002 |
| As time | 14555 seconds = 4 h 2 min 35 s |
Is 14555 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 2) | 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 (14555 ÷ 5 = 2911) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 3) | 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 | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14555 a prime number?
No. 14555 = 5 × 41 × 71, so it is divisible by 5.
What are the factors of 14555?
1, 5, 41, 71, 205, 355, 2911, 14555.
What is 14555 in binary?
11100011011011 (hexadecimal 38DB, octal 34333).
What is the square root of 14555?
About 120.6441.
Is 14555 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 14555?
It is a composite number with 8 divisors.