The number 956
956 is a composite number with 6 divisors. Its prime factorisation is × 239. Divisors (6): 1, 2, 4, 239, 478, 956.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
956 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
956 is composite. Its prime factorisation is
- 3
The divisors add up to 1680; without 956 itself that is 724, so 956 is deficient (724 is less than 956). Euler's totient φ(956) = 476 numbers up to 956 share no factor with it.
- 4
The digits of 956 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 54 steps to reach 1.
LaTeX source of the formulas on this page
\[ 956 = 2^{2} \times 239 \]956 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 1680 |
| Euler totient φ(n) | 476 |
| Square | 913936 |
| Cube | 873722816 |
| Square root | 30.919250 (= 2√239) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 54 |
| Scientific notation | 9.56 × |
956 in other forms
| Form | Value |
|---|---|
| In words | nine hundred and fifty-six |
| Roman numerals | CMLVI |
| Binary (base 2) | 1110111100 |
| Octal (base 8) | 1674 |
| Hexadecimal (base 16) | 3BC |
| Base 3 | 1022102 |
| As time | 956 seconds = 15 min 56 s |
Is 956 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (956 ÷ 2 = 478) | 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 | Yes (956 ÷ 4 = 239) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 4) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 956 a prime number?
No. 956 = × 239, so it is divisible by 2.
What are the factors of 956?
1, 2, 4, 239, 478, 956.
What is 956 in binary?
1110111100 (hexadecimal 3BC, octal 1674).
What is the square root of 956?
About 30.9192, exactly 2√239.
What is 956 in Roman numerals?
CMLVI.
Is 956 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 956?
It is a composite number with 6 divisors.