The number 93841
93841 is a composite number with 8 divisors. Its prime factorisation is 11 × 19 × 449. Divisors (8): 1, 11, 19, 209, 449, 4939, 8531, 93841.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93841 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93841 is composite. Its prime factorisation is
- 3
The divisors add up to 108000; without 93841 itself that is 14159, so 93841 is deficient (14159 is less than 93841). Euler's totient φ(93841) = 80640 numbers up to 93841 share no factor with it.
- 4
The digits of 93841 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 252 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93841 = 11 \times 19 \times 449 \]
93841 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 108000 |
| Euler totient φ(n) | 80640 |
| Square | 8806133281 |
| Cube | 826376353222321 |
| Square root | 306.334784 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 252 |
| Scientific notation | 9.3841 × |
93841 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand eight hundred and forty-one |
| Binary (base 2) | 10110111010010001 |
| Octal (base 8) | 267221 |
| Hexadecimal (base 16) | 16E91 |
| Base 3 | 11202201121 |
| As time | 93841 seconds = 26 h 4 min 1 s |
Is 93841 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 | 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 7) | 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 (93841 ÷ 11 = 8531) | 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 93841 a prime number?
No. 93841 = 11 × 19 × 449, so it is divisible by 11.
What are the factors of 93841?
1, 11, 19, 209, 449, 4939, 8531, 93841.
What is 93841 in binary?
10110111010010001 (hexadecimal 16E91, octal 267221).
What is the square root of 93841?
About 306.3348.
Is 93841 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 93841?
It is a composite number with 8 divisors.