The number 959
959 is a palindrome: it reads 959 backwards too. Its prime factorisation is 7 × 137. Divisors (4): 1, 7, 137, 959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 959: a palindrome: it reads 959 backwards too; a semiprime: 7 × 137, the product of two primes.
- 2
959 is composite. Its prime factorisation is
- 3
The divisors add up to 1104; without 959 itself that is 145, so 959 is deficient (145 is less than 959). Euler's totient φ(959) = 816 numbers up to 959 share no factor with it.
- 4
The digits of 959 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 129 steps to reach 1.
LaTeX source of the formulas on this page
\[ 959 = 7 \times 137 \]
959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1104 |
| Euler totient φ(n) | 816 |
| Square | 919681 |
| Cube | 881974079 |
| Square root | 30.967725 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 129 |
| Scientific notation | 9.59 × |
959 in other forms
| Form | Value |
|---|---|
| In words | nine hundred and fifty-nine |
| Roman numerals | CMLIX |
| Binary (base 2) | 1110111111 |
| Octal (base 8) | 1677 |
| Hexadecimal (base 16) | 3BF |
| Base 3 | 1022112 |
| As time | 959 seconds = 15 min 59 s |
Is 959 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 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (959 ÷ 7 = 137) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 959 a prime number?
No. 959 = 7 × 137, so it is divisible by 7.
What are the factors of 959?
1, 7, 137, 959.
What is 959 in binary?
1110111111 (hexadecimal 3BF, octal 1677).
What is the square root of 959?
About 30.9677.
What is 959 in Roman numerals?
CMLIX.
Is 959 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 959?
959 is a palindrome: it reads 959 backwards too; a semiprime: 7 × 137, the product of two primes.