The number 11151
11151 is a composite number with 16 divisors. Its prime factorisation is × 7 × 59. Divisors (16): 1, 3, 7, 9, 21, 27, 59, 63, 177, 189, 413, 531, 1239, 1593, 3717, 11151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11151: a Harshad number: divisible by its digit sum 9.
- 2
11151 is composite. Its prime factorisation is
- 3
The divisors add up to 19200; without 11151 itself that is 8049, so 11151 is deficient (8049 is less than 11151). Euler's totient φ(11151) = 6264 numbers up to 11151 share no factor with it.
- 4
The digits of 11151 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11151 = 3^{3} \times 7 \times 59 \]11151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 19200 |
| Euler totient φ(n) | 6264 |
| Square | 124344801 |
| Cube | 1386568875951 |
| Square root | 105.598295 (= 3√1239) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.1151 × |
11151 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and fifty-one |
| Binary (base 2) | 10101110001111 |
| Octal (base 8) | 25617 |
| Hexadecimal (base 16) | 2B8F |
| Base 3 | 120022000 |
| As time | 11151 seconds = 3 h 5 min 51 s |
Is 11151 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 (11151 ÷ 3 = 3717) | 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 | Yes (11151 ÷ 7 = 1593) | 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 | Yes (11151 ÷ 9 = 1239) | 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 8) | 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 11151 a prime number?
No. 11151 = × 7 × 59, so it is divisible by 3.
What are the factors of 11151?
1, 3, 7, 9, 21, 27, 59, 63, 177, 189, 413, 531, 1239, 1593, 3717, 11151.
What is 11151 in binary?
10101110001111 (hexadecimal 2B8F, octal 25617).
What is the square root of 11151?
About 105.5983, exactly 3√1239.
Is 11151 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 11151?
11151 is a Harshad number: divisible by its digit sum 9.