The number 94039
94039 is a composite number with 8 divisors. Its prime factorisation is 11 × 83 × 103. Divisors (8): 1, 11, 83, 103, 913, 1133, 8549, 94039.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
94039 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
94039 is composite. Its prime factorisation is
- 3
The divisors add up to 104832; without 94039 itself that is 10793, so 94039 is deficient (10793 is less than 94039). Euler's totient φ(94039) = 83640 numbers up to 94039 share no factor with it.
- 4
The digits of 94039 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94039 = 11 \times 83 \times 103 \]
94039 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 104832 |
| Euler totient φ(n) | 83640 |
| Square | 8843333521 |
| Cube | 831618240981319 |
| Square root | 306.657790 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.4039 × |
94039 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand and thirty-nine |
| Binary (base 2) | 10110111101010111 |
| Octal (base 8) | 267527 |
| Hexadecimal (base 16) | 16F57 |
| Base 3 | 11202222221 |
| As time | 94039 seconds = 26 h 7 min 19 s |
Is 94039 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 1) | 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 7) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (94039 ÷ 11 = 8549) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94039 a prime number?
No. 94039 = 11 × 83 × 103, so it is divisible by 11.
What are the factors of 94039?
1, 11, 83, 103, 913, 1133, 8549, 94039.
What is 94039 in binary?
10110111101010111 (hexadecimal 16F57, octal 267527).
What is the square root of 94039?
About 306.6578.
Is 94039 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 94039?
It is a composite number with 8 divisors.