The number 94071
94071 is a composite number with 4 divisors. Its prime factorisation is 3 × 31357. Divisors (4): 1, 3, 31357, 94071.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 94071: a semiprime: 3 × 31357, the product of two primes.
- 2
94071 is composite. Its prime factorisation is
- 3
The divisors add up to 125432; without 94071 itself that is 31361, so 94071 is deficient (31361 is less than 94071). Euler's totient φ(94071) = 62712 numbers up to 94071 share no factor with it.
- 4
The digits of 94071 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 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94071 = 3 \times 31357 \]
94071 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 125432 |
| Euler totient φ(n) | 62712 |
| Square | 8849353041 |
| Cube | 832467489919911 |
| Square root | 306.709961 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.4071 × |
94071 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand and seventy-one |
| Binary (base 2) | 10110111101110111 |
| Octal (base 8) | 267567 |
| Hexadecimal (base 16) | 16F77 |
| Base 3 | 11210001010 |
| As time | 94071 seconds = 26 h 7 min 51 s |
Is 94071 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 (94071 ÷ 3 = 31357) | 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 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 5) | 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 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94071 a prime number?
No. 94071 = 3 × 31357, so it is divisible by 3.
What are the factors of 94071?
1, 3, 31357, 94071.
What is 94071 in binary?
10110111101110111 (hexadecimal 16F77, octal 267567).
What is the square root of 94071?
About 306.7100.
Is 94071 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 94071?
94071 is a semiprime: 3 × 31357, the product of two primes.