The number 94671
94671 is a composite number with 12 divisors. Its prime factorisation is × 67 × 157. Divisors (12): 1, 3, 9, 67, 157, 201, 471, 603, 1413, 10519, 31557, 94671.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
94671 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
94671 is composite. Its prime factorisation is
- 3
The divisors add up to 139672; without 94671 itself that is 45001, so 94671 is deficient (45001 is less than 94671). Euler's totient φ(94671) = 61776 numbers up to 94671 share no factor with it.
- 4
The digits of 94671 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94671 = 3^{2} \times 67 \times 157 \]94671 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 139672 |
| Euler totient φ(n) | 61776 |
| Square | 8962598241 |
| Cube | 848498138073711 |
| Square root | 307.686529 (= 3√10519) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.4671 × |
94671 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand six hundred and seventy-one |
| Binary (base 2) | 10111000111001111 |
| Octal (base 8) | 270717 |
| Hexadecimal (base 16) | 171CF |
| Base 3 | 11210212100 |
| As time | 94671 seconds = 26 h 17 min 51 s |
Is 94671 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 (94671 ÷ 3 = 31557) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (94671 ÷ 9 = 10519) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94671 a prime number?
No. 94671 = × 67 × 157, so it is divisible by 3.
What are the factors of 94671?
1, 3, 9, 67, 157, 201, 471, 603, 1413, 10519, 31557, 94671.
What is 94671 in binary?
10111000111001111 (hexadecimal 171CF, octal 270717).
What is the square root of 94671?
About 307.6865, exactly 3√10519.
Is 94671 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 94671?
It is a composite number with 12 divisors.