The number 14055
14055 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 937. Divisors (8): 1, 3, 5, 15, 937, 2811, 4685, 14055.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14055: a Harshad number: divisible by its digit sum 15.
- 2
14055 is composite. Its prime factorisation is
- 3
The divisors add up to 22512; without 14055 itself that is 8457, so 14055 is deficient (8457 is less than 14055). Euler's totient φ(14055) = 7488 numbers up to 14055 share no factor with it.
- 4
The digits of 14055 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 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14055 = 3 \times 5 \times 937 \]
14055 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22512 |
| Euler totient φ(n) | 7488 |
| Square | 197543025 |
| Cube | 2776467216375 |
| Square root | 118.553785 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.4055 × |
14055 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand and fifty-five |
| Binary (base 2) | 11011011100111 |
| Octal (base 8) | 33347 |
| Hexadecimal (base 16) | 36E7 |
| Base 3 | 201021120 |
| As time | 14055 seconds = 3 h 54 min 15 s |
Is 14055 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 | Yes (14055 ÷ 3 = 4685) | 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 (14055 ÷ 5 = 2811) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 6) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14055 a prime number?
No. 14055 = 3 × 5 × 937, so it is divisible by 3.
What are the factors of 14055?
1, 3, 5, 15, 937, 2811, 4685, 14055.
What is 14055 in binary?
11011011100111 (hexadecimal 36E7, octal 33347).
What is the square root of 14055?
About 118.5538.
Is 14055 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 14055?
14055 is a Harshad number: divisible by its digit sum 15.