The number 93141
93141 is a composite number with 12 divisors. Its prime factorisation is × 79 × 131. Divisors (12): 1, 3, 9, 79, 131, 237, 393, 711, 1179, 10349, 31047, 93141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93141 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93141 is composite. Its prime factorisation is
- 3
The divisors add up to 137280; without 93141 itself that is 44139, so 93141 is deficient (44139 is less than 93141). Euler's totient φ(93141) = 60840 numbers up to 93141 share no factor with it.
- 4
The digits of 93141 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93141 = 3^{2} \times 79 \times 131 \]93141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 137280 |
| Euler totient φ(n) | 60840 |
| Square | 8675245881 |
| Cube | 808021076602221 |
| Square root | 305.190105 (= 3√10349) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.3141 × |
93141 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand one hundred and forty-one |
| Binary (base 2) | 10110101111010101 |
| Octal (base 8) | 265725 |
| Hexadecimal (base 16) | 16BD5 |
| Base 3 | 11201202200 |
| As time | 93141 seconds = 25 h 52 min 21 s |
Is 93141 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 (93141 ÷ 3 = 31047) | 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 | Yes (93141 ÷ 9 = 10349) | 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 4) | 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 93141 a prime number?
No. 93141 = × 79 × 131, so it is divisible by 3.
What are the factors of 93141?
1, 3, 9, 79, 131, 237, 393, 711, 1179, 10349, 31047, 93141.
What is 93141 in binary?
10110101111010101 (hexadecimal 16BD5, octal 265725).
What is the square root of 93141?
About 305.1901, exactly 3√10349.
Is 93141 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 93141?
It is a composite number with 12 divisors.