The number 93041
93041 is a composite number with 8 divisors. Its prime factorisation is 13 × 17 × 421. Divisors (8): 1, 13, 17, 221, 421, 5473, 7157, 93041.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93041: a Harshad number: divisible by its digit sum 17.
- 2
93041 is composite. Its prime factorisation is
- 3
The divisors add up to 106344; without 93041 itself that is 13303, so 93041 is deficient (13303 is less than 93041). Euler's totient φ(93041) = 80640 numbers up to 93041 share no factor with it.
- 4
The digits of 93041 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93041 = 13 \times 17 \times 421 \]
93041 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 106344 |
| Euler totient φ(n) | 80640 |
| Square | 8656627681 |
| Cube | 805421296067921 |
| Square root | 305.026228 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.3041 × |
93041 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand and forty-one |
| Binary (base 2) | 10110101101110001 |
| Octal (base 8) | 265561 |
| Hexadecimal (base 16) | 16B71 |
| Base 3 | 11201121222 |
| As time | 93041 seconds = 25 h 50 min 41 s |
Is 93041 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 1) | 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 4) | 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 8) | 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 3) | 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 93041 a prime number?
No. 93041 = 13 × 17 × 421, so it is divisible by 13.
What are the factors of 93041?
1, 13, 17, 221, 421, 5473, 7157, 93041.
What is 93041 in binary?
10110101101110001 (hexadecimal 16B71, octal 265561).
What is the square root of 93041?
About 305.0262.
Is 93041 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 93041?
93041 is a Harshad number: divisible by its digit sum 17.