The number 11051
11051 is a composite number with 4 divisors. Its prime factorisation is 43 × 257. Divisors (4): 1, 43, 257, 11051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11051: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 43 × 257, the product of two primes.
- 2
11051 is composite. Its prime factorisation is
- 3
The divisors add up to 11352; without 11051 itself that is 301, so 11051 is deficient (301 is less than 11051). Euler's totient φ(11051) = 10752 numbers up to 11051 share no factor with it.
- 4
The digits of 11051 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 117 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11051 = 43 \times 257 \]
11051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11352 |
| Euler totient φ(n) | 10752 |
| Square | 122124601 |
| Cube | 1349598965651 |
| Square root | 105.123737 |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 117 |
| Scientific notation | 1.1051 × |
11051 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand and fifty-one |
| Binary (base 2) | 10101100101011 |
| Octal (base 8) | 25453 |
| Hexadecimal (base 16) | 2B2B |
| Base 3 | 120011022 |
| As time | 11051 seconds = 3 h 4 min 11 s |
Is 11051 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 5) | 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 3) | 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 7) | 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 11051 a prime number?
No. 11051 = 43 × 257, so it is divisible by 43.
What are the factors of 11051?
1, 43, 257, 11051.
What is 11051 in binary?
10101100101011 (hexadecimal 2B2B, octal 25453).
What is the square root of 11051?
About 105.1237.
Is 11051 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 11051?
11051 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 43 × 257, the product of two primes.