The number 1101
1101 is a composite number with 4 divisors. Its prime factorisation is 3 × 367. Divisors (4): 1, 3, 367, 1101.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1101: a Harshad number: divisible by its digit sum 3; a semiprime: 3 × 367, the product of two primes.
- 2
1101 is composite. Its prime factorisation is
- 3
The divisors add up to 1472; without 1101 itself that is 371, so 1101 is deficient (371 is less than 1101). Euler's totient φ(1101) = 732 numbers up to 1101 share no factor with it.
- 4
The digits of 1101 add up to 3, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 93 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1101 = 3 \times 367 \]
1101 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1472 |
| Euler totient φ(n) | 732 |
| Square | 1212201 |
| Cube | 1334633301 |
| Square root | 33.181320 |
| Digit sum / digital root | 3 / 3 |
| Collatz steps to 1 | 93 |
| Scientific notation | 1.101 × |
1101 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and one |
| Roman numerals | MCI |
| Binary (base 2) | 10001001101 |
| Octal (base 8) | 2115 |
| Hexadecimal (base 16) | 44D |
| Base 3 | 1111210 |
| As time | 1101 seconds = 18 min 21 s |
Is 1101 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 (1101 ÷ 3 = 367) | 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 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 | 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 3) | 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 1) | 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 1101 a prime number?
No. 1101 = 3 × 367, so it is divisible by 3.
What are the factors of 1101?
1, 3, 367, 1101.
What is 1101 in binary?
10001001101 (hexadecimal 44D, octal 2115).
What is the square root of 1101?
About 33.1813.
What is 1101 in Roman numerals?
MCI.
Is 1101 divisible by 3?
Yes. Its digits add up to 3, a multiple of 3.
What is special about the number 1101?
1101 is a Harshad number: divisible by its digit sum 3; a semiprime: 3 × 367, the product of two primes.