The number 1113
1113 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 53. Divisors (8): 1, 3, 7, 21, 53, 159, 371, 1113.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1113 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1113 is composite. Its prime factorisation is
- 3
The divisors add up to 1728; without 1113 itself that is 615, so 1113 is deficient (615 is less than 1113). Euler's totient φ(1113) = 624 numbers up to 1113 share no factor with it.
- 4
The digits of 1113 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 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1113 = 3 \times 7 \times 53 \]
1113 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 1728 |
| Euler totient φ(n) | 624 |
| Square | 1238769 |
| Cube | 1378749897 |
| Square root | 33.361655 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 137 |
| Scientific notation | 1.113 × |
1113 in other forms
| Form | Value |
|---|---|
| In words | one thousand one hundred and thirteen |
| Roman numerals | MCXIII |
| Binary (base 2) | 10001011001 |
| Octal (base 8) | 2131 |
| Hexadecimal (base 16) | 459 |
| Base 3 | 1112020 |
| As time | 1113 seconds = 18 min 33 s |
Is 1113 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 (1113 ÷ 3 = 371) | 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 | Yes (1113 ÷ 7 = 159) | 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 1) | 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 1113 a prime number?
No. 1113 = 3 × 7 × 53, so it is divisible by 3.
What are the factors of 1113?
1, 3, 7, 21, 53, 159, 371, 1113.
What is 1113 in binary?
10001011001 (hexadecimal 459, octal 2131).
What is the square root of 1113?
About 33.3617.
What is 1113 in Roman numerals?
MCXIII.
Is 1113 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 1113?
It is a composite number with 8 divisors.