The number 9113
9113 is a composite number with 4 divisors. Its prime factorisation is 13 × 701. Divisors (4): 1, 13, 701, 9113.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9113: a semiprime: 13 × 701, the product of two primes.
- 2
9113 is composite. Its prime factorisation is
- 3
The divisors add up to 9828; without 9113 itself that is 715, so 9113 is deficient (715 is less than 9113). Euler's totient φ(9113) = 8400 numbers up to 9113 share no factor with it.
- 4
The digits of 9113 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9113 = 13 \times 701 \]
9113 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 9828 |
| Euler totient φ(n) | 8400 |
| Square | 83046769 |
| Cube | 756805205897 |
| Square root | 95.462034 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 60 |
| Scientific notation | 9.113 × |
9113 in other forms
| Form | Value |
|---|---|
| In words | nine thousand one hundred and thirteen |
| Binary (base 2) | 10001110011001 |
| Octal (base 8) | 21631 |
| Hexadecimal (base 16) | 2399 |
| Base 3 | 110111112 |
| As time | 9113 seconds = 2 h 31 min 53 s |
Is 9113 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 5) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9113 a prime number?
No. 9113 = 13 × 701, so it is divisible by 13.
What are the factors of 9113?
1, 13, 701, 9113.
What is 9113 in binary?
10001110011001 (hexadecimal 2399, octal 21631).
What is the square root of 9113?
About 95.4620.
Is 9113 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 9113?
9113 is a semiprime: 13 × 701, the product of two primes.