The number 958
958 is a composite number with 4 divisors. Its prime factorisation is 2 × 479. Divisors (4): 1, 2, 479, 958.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 958: a semiprime: 2 × 479, the product of two primes.
- 2
958 is composite. Its prime factorisation is
- 3
The divisors add up to 1440; without 958 itself that is 482, so 958 is deficient (482 is less than 958). Euler's totient φ(958) = 478 numbers up to 958 share no factor with it.
- 4
The digits of 958 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 54 steps to reach 1.
LaTeX source of the formulas on this page
\[ 958 = 2 \times 479 \]
958 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1440 |
| Euler totient φ(n) | 478 |
| Square | 917764 |
| Cube | 879217912 |
| Square root | 30.951575 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 54 |
| Scientific notation | 9.58 × |
958 in other forms
| Form | Value |
|---|---|
| In words | nine hundred and fifty-eight |
| Roman numerals | CMLVIII |
| Binary (base 2) | 1110111110 |
| Octal (base 8) | 1676 |
| Hexadecimal (base 16) | 3BE |
| Base 3 | 1022111 |
| As time | 958 seconds = 15 min 58 s |
Is 958 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (958 ÷ 2 = 479) | 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 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 | No (remainder 4) | 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 | No (remainder 4) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 958 a prime number?
No. 958 = 2 × 479, so it is divisible by 2.
What are the factors of 958?
1, 2, 479, 958.
What is 958 in binary?
1110111110 (hexadecimal 3BE, octal 1676).
What is the square root of 958?
About 30.9516.
What is 958 in Roman numerals?
CMLVIII.
Is 958 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 958?
958 is a semiprime: 2 × 479, the product of two primes.