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