The number 957
957 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 29. Divisors (8): 1, 3, 11, 29, 33, 87, 319, 957.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
957 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
957 is composite. Its prime factorisation is
- 3
The divisors add up to 1440; without 957 itself that is 483, so 957 is deficient (483 is less than 957). Euler's totient φ(957) = 560 numbers up to 957 share no factor with it.
- 4
The digits of 957 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 54 steps to reach 1.
LaTeX source of the formulas on this page
\[ 957 = 3 \times 11 \times 29 \]
957 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 1440 |
| Euler totient φ(n) | 560 |
| Square | 915849 |
| Cube | 876467493 |
| Square root | 30.935417 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 54 |
| Scientific notation | 9.57 × |
957 in other forms
| Form | Value |
|---|---|
| In words | nine hundred and fifty-seven |
| Roman numerals | CMLVII |
| Binary (base 2) | 1110111101 |
| Octal (base 8) | 1675 |
| Hexadecimal (base 16) | 3BD |
| Base 3 | 1022110 |
| As time | 957 seconds = 15 min 57 s |
Is 957 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 (957 ÷ 3 = 319) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 5) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (957 ÷ 11 = 87) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 957 a prime number?
No. 957 = 3 × 11 × 29, so it is divisible by 3.
What are the factors of 957?
1, 3, 11, 29, 33, 87, 319, 957.
What is 957 in binary?
1110111101 (hexadecimal 3BD, octal 1675).
What is the square root of 957?
About 30.9354.
What is 957 in Roman numerals?
CMLVII.
Is 957 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 957?
It is a composite number with 8 divisors.