The number 11951
11951 is a composite number with 8 divisors. Its prime factorisation is 17 × 19 × 37. Divisors (8): 1, 17, 19, 37, 323, 629, 703, 11951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11951: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17.
- 2
11951 is composite. Its prime factorisation is
- 3
The divisors add up to 13680; without 11951 itself that is 1729, so 11951 is deficient (1729 is less than 11951). Euler's totient φ(11951) = 10368 numbers up to 11951 share no factor with it.
- 4
The digits of 11951 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11951 = 17 \times 19 \times 37 \]
11951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 13680 |
| Euler totient φ(n) | 10368 |
| Square | 142826401 |
| Cube | 1706918318351 |
| Square root | 109.320629 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 94 |
| Scientific notation | 1.1951 × |
11951 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand nine hundred and fifty-one |
| Binary (base 2) | 10111010101111 |
| Octal (base 8) | 27257 |
| Hexadecimal (base 16) | 2EAF |
| Base 3 | 121101122 |
| As time | 11951 seconds = 3 h 19 min 11 s |
Is 11951 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 1) | 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 | No (remainder 2) | 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 8) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11951 a prime number?
No. 11951 = 17 × 19 × 37, so it is divisible by 17.
What are the factors of 11951?
1, 17, 19, 37, 323, 629, 703, 11951.
What is 11951 in binary?
10111010101111 (hexadecimal 2EAF, octal 27257).
What is the square root of 11951?
About 109.3206.
Is 11951 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 11951?
11951 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17.