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