The number 9141
9141 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 277. Divisors (8): 1, 3, 11, 33, 277, 831, 3047, 9141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9141 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9141 is composite. Its prime factorisation is
- 3
The divisors add up to 13344; without 9141 itself that is 4203, so 9141 is deficient (4203 is less than 9141). Euler's totient φ(9141) = 5520 numbers up to 9141 share no factor with it.
- 4
The digits of 9141 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9141 = 3 \times 11 \times 277 \]
9141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 13344 |
| Euler totient φ(n) | 5520 |
| Square | 83557881 |
| Cube | 763802590221 |
| Square root | 95.608577 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 34 |
| Scientific notation | 9.141 × |
9141 in other forms
| Form | Value |
|---|---|
| In words | nine thousand one hundred and forty-one |
| Binary (base 2) | 10001110110101 |
| Octal (base 8) | 21665 |
| Hexadecimal (base 16) | 23B5 |
| Base 3 | 110112120 |
| As time | 9141 seconds = 2 h 32 min 21 s |
Is 9141 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 (9141 ÷ 3 = 3047) | 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 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 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (9141 ÷ 11 = 831) | 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 9141 a prime number?
No. 9141 = 3 × 11 × 277, so it is divisible by 3.
What are the factors of 9141?
1, 3, 11, 33, 277, 831, 3047, 9141.
What is 9141 in binary?
10001110110101 (hexadecimal 23B5, octal 21665).
What is the square root of 9141?
About 95.6086.
Is 9141 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 9141?
It is a composite number with 8 divisors.