The number 14958
14958 is a composite number with 16 divisors. Its prime factorisation is 2 × × 277. Divisors (16): 1, 2, 3, 6, 9, 18, 27, 54, 277, 554, 831, 1662, 2493, 4986, 7479, 14958.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14958: a Harshad number: divisible by its digit sum 27.
- 2
14958 is composite. Its prime factorisation is
- 3
The divisors add up to 33360; without 14958 itself that is 18402, so 14958 is abundant (18402 is more than 14958). Euler's totient φ(14958) = 4968 numbers up to 14958 share no factor with it.
- 4
The digits of 14958 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14958 = 2 \times 3^{3} \times 277 \]14958 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 33360 |
| Euler totient φ(n) | 4968 |
| Square | 223741764 |
| Cube | 3346729305912 |
| Square root | 122.302903 (= 3√1662) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 115 |
| Scientific notation | 1.4958 × |
14958 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and fifty-eight |
| Binary (base 2) | 11101001101110 |
| Octal (base 8) | 35156 |
| Hexadecimal (base 16) | 3A6E |
| Base 3 | 202112000 |
| As time | 14958 seconds = 4 h 9 min 18 s |
Is 14958 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14958 ÷ 2 = 7479) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14958 ÷ 3 = 4986) | 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 (14958 ÷ 6 = 2493) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (14958 ÷ 9 = 1662) | 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 | No (remainder 9) | 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 14958 a prime number?
No. 14958 = 2 × × 277, so it is divisible by 2.
What are the factors of 14958?
1, 2, 3, 6, 9, 18, 27, 54, 277, 554, 831, 1662, 2493, 4986, 7479, 14958.
What is 14958 in binary?
11101001101110 (hexadecimal 3A6E, octal 35156).
What is the square root of 14958?
About 122.3029, exactly 3√1662.
Is 14958 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 14958?
14958 is a Harshad number: divisible by its digit sum 27.