The number 11062
11062 is a composite number with 4 divisors. Its prime factorisation is 2 × 5531. Divisors (4): 1, 2, 5531, 11062.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11062: a semiprime: 2 × 5531, the product of two primes.
- 2
11062 is composite. Its prime factorisation is
- 3
The divisors add up to 16596; without 11062 itself that is 5534, so 11062 is deficient (5534 is less than 11062). Euler's totient φ(11062) = 5530 numbers up to 11062 share no factor with it.
- 4
The digits of 11062 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11062 = 2 \times 5531 \]
11062 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16596 |
| Euler totient φ(n) | 5530 |
| Square | 122367844 |
| Cube | 1353633090328 |
| Square root | 105.176043 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.1062 × |
11062 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand and sixty-two |
| Binary (base 2) | 10101100110110 |
| Octal (base 8) | 25466 |
| Hexadecimal (base 16) | 2B36 |
| Base 3 | 120011201 |
| As time | 11062 seconds = 3 h 4 min 22 s |
Is 11062 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11062 ÷ 2 = 5531) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11062 a prime number?
No. 11062 = 2 × 5531, so it is divisible by 2.
What are the factors of 11062?
1, 2, 5531, 11062.
What is 11062 in binary?
10101100110110 (hexadecimal 2B36, octal 25466).
What is the square root of 11062?
About 105.1760.
Is 11062 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 11062?
11062 is a semiprime: 2 × 5531, the product of two primes.