The number 11013
11013 is a composite number with 4 divisors. Its prime factorisation is 3 × 3671. Divisors (4): 1, 3, 3671, 11013.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11013: a semiprime: 3 × 3671, the product of two primes.
- 2
11013 is composite. Its prime factorisation is
- 3
The divisors add up to 14688; without 11013 itself that is 3675, so 11013 is deficient (3675 is less than 11013). Euler's totient φ(11013) = 7340 numbers up to 11013 share no factor with it.
- 4
The digits of 11013 add up to 6, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11013 = 3 \times 3671 \]
11013 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14688 |
| Euler totient φ(n) | 7340 |
| Square | 121286169 |
| Cube | 1335724579197 |
| Square root | 104.942842 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.1013 × |
11013 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand and thirteen |
| Binary (base 2) | 10101100000101 |
| Octal (base 8) | 25405 |
| Hexadecimal (base 16) | 2B05 |
| Base 3 | 120002220 |
| As time | 11013 seconds = 3 h 3 min 33 s |
Is 11013 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 (11013 ÷ 3 = 3671) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11013 a prime number?
No. 11013 = 3 × 3671, so it is divisible by 3.
What are the factors of 11013?
1, 3, 3671, 11013.
What is 11013 in binary?
10101100000101 (hexadecimal 2B05, octal 25405).
What is the square root of 11013?
About 104.9428.
Is 11013 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 11013?
11013 is a semiprime: 3 × 3671, the product of two primes.