The number 94341
94341 is a composite number with 16 divisors. Its prime factorisation is 3 × 13 × 41 × 59. Divisors (16): 1, 3, 13, 39, 41, 59, 123, 177, 533, 767, 1599, 2301, 2419, 7257, 31447, 94341.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
94341 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
94341 is composite. Its prime factorisation is
- 3
The divisors add up to 141120; without 94341 itself that is 46779, so 94341 is deficient (46779 is less than 94341). Euler's totient φ(94341) = 55680 numbers up to 94341 share no factor with it.
- 4
The digits of 94341 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94341 = 3 \times 13 \times 41 \times 59 \]
94341 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 141120 |
| Euler totient φ(n) | 55680 |
| Square | 8900224281 |
| Cube | 839656058893821 |
| Square root | 307.149801 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.4341 × |
94341 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand three hundred and forty-one |
| Binary (base 2) | 10111000010000101 |
| Octal (base 8) | 270205 |
| Hexadecimal (base 16) | 17085 |
| Base 3 | 11210102010 |
| As time | 94341 seconds = 26 h 12 min 21 s |
Is 94341 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 (94341 ÷ 3 = 31447) | 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 2) | 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 3) | 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 5) | 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 94341 a prime number?
No. 94341 = 3 × 13 × 41 × 59, so it is divisible by 3.
What are the factors of 94341?
1, 3, 13, 39, 41, 59, 123, 177, 533, 767, 1599, 2301, 2419, 7257, 31447, 94341.
What is 94341 in binary?
10111000010000101 (hexadecimal 17085, octal 270205).
What is the square root of 94341?
About 307.1498.
Is 94341 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 94341?
It is a composite number with 16 divisors.