The number 94041
94041 is a composite number with 16 divisors. Its prime factorisation is × 43. Divisors (16): 1, 3, 9, 27, 43, 81, 129, 243, 387, 729, 1161, 2187, 3483, 10449, 31347, 94041.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
94041 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
94041 is composite. Its prime factorisation is
- 3
The divisors add up to 144320; without 94041 itself that is 50279, so 94041 is deficient (50279 is less than 94041). Euler's totient φ(94041) = 61236 numbers up to 94041 share no factor with it.
- 4
The digits of 94041 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 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94041 = 3^{7} \times 43 \]94041 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 144320 |
| Euler totient φ(n) | 61236 |
| Square | 8843709681 |
| Cube | 831671302110921 |
| Square root | 306.661051 (= 27√129) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 58 |
| Scientific notation | 9.4041 × |
94041 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand and forty-one |
| Binary (base 2) | 10110111101011001 |
| Octal (base 8) | 267531 |
| Hexadecimal (base 16) | 16F59 |
| Base 3 | 11210000000 |
| As time | 94041 seconds = 26 h 7 min 21 s |
Is 94041 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 (94041 ÷ 3 = 31347) | 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 3) | 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 | Yes (94041 ÷ 9 = 10449) | 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 2) | 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 94041 a prime number?
No. 94041 = × 43, so it is divisible by 3.
What are the factors of 94041?
1, 3, 9, 27, 43, 81, 129, 243, 387, 729, 1161, 2187, 3483, 10449, 31347, 94041.
What is 94041 in binary?
10110111101011001 (hexadecimal 16F59, octal 267531).
What is the square root of 94041?
About 306.6611, exactly 27√129.
Is 94041 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 94041?
It is a composite number with 16 divisors.