The number 10951
10951 is a composite number with 4 divisors. Its prime factorisation is 47 × 233. Divisors (4): 1, 47, 233, 10951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10951: a semiprime: 47 × 233, the product of two primes.
- 2
10951 is composite. Its prime factorisation is
- 3
The divisors add up to 11232; without 10951 itself that is 281, so 10951 is deficient (281 is less than 10951). Euler's totient φ(10951) = 10672 numbers up to 10951 share no factor with it.
- 4
The digits of 10951 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 161 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10951 = 47 \times 233 \]
10951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11232 |
| Euler totient φ(n) | 10672 |
| Square | 119924401 |
| Cube | 1313292115351 |
| Square root | 104.647026 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 161 |
| Scientific notation | 1.0951 × |
10951 in other forms
| Form | Value |
|---|---|
| In words | ten thousand nine hundred and fifty-one |
| Binary (base 2) | 10101011000111 |
| Octal (base 8) | 25307 |
| Hexadecimal (base 16) | 2AC7 |
| Base 3 | 120000121 |
| As time | 10951 seconds = 3 h 2 min 31 s |
Is 10951 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10951 a prime number?
No. 10951 = 47 × 233, so it is divisible by 47.
What are the factors of 10951?
1, 47, 233, 10951.
What is 10951 in binary?
10101011000111 (hexadecimal 2AC7, octal 25307).
What is the square root of 10951?
About 104.6470.
Is 10951 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 10951?
10951 is a semiprime: 47 × 233, the product of two primes.