The number 14058
14058 is a composite number with 24 divisors. Its prime factorisation is 2 × × 11 × 71. Divisors (24): 1, 2, 3, 6, 9, 11, 18, 22, 33, 66, 71, 99, 142, 198, 213, 426 … 14058.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14058: a Harshad number: divisible by its digit sum 18.
- 2
14058 is composite. Its prime factorisation is
- 3
The divisors add up to 33696; without 14058 itself that is 19638, so 14058 is abundant (19638 is more than 14058). Euler's totient φ(14058) = 4200 numbers up to 14058 share no factor with it.
- 4
The digits of 14058 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14058 = 2 \times 3^{2} \times 11 \times 71 \]14058 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 33696 |
| Euler totient φ(n) | 4200 |
| Square | 197627364 |
| Cube | 2778245483112 |
| Square root | 118.566437 (= 3√1562) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.4058 × |
14058 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand and fifty-eight |
| Binary (base 2) | 11011011101010 |
| Octal (base 8) | 33352 |
| Hexadecimal (base 16) | 36EA |
| Base 3 | 201021200 |
| As time | 14058 seconds = 3 h 54 min 18 s |
Is 14058 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14058 ÷ 2 = 7029) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14058 ÷ 3 = 4686) | 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 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (14058 ÷ 6 = 2343) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (14058 ÷ 9 = 1562) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (14058 ÷ 11 = 1278) | 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 14058 a prime number?
No. 14058 = 2 × × 11 × 71, so it is divisible by 2.
What are the factors of 14058?
1, 2, 3, 6, 9, 11, 18, 22, 33, 66, 71, 99, 142, 198, 213, 426, 639, 781, 1278, 1562, 2343, 4686, 7029, 14058.
What is 14058 in binary?
11011011101010 (hexadecimal 36EA, octal 33352).
What is the square root of 14058?
About 118.5664, exactly 3√1562.
Is 14058 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 14058?
14058 is a Harshad number: divisible by its digit sum 18.