The number 93671
93671 is a composite number with 4 divisors. Its prime factorisation is 47 × 1993. Divisors (4): 1, 47, 1993, 93671.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93671: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 1993, the product of two primes.
- 2
93671 is composite. Its prime factorisation is
- 3
The divisors add up to 95712; without 93671 itself that is 2041, so 93671 is deficient (2041 is less than 93671). Euler's totient φ(93671) = 91632 numbers up to 93671 share no factor with it.
- 4
The digits of 93671 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93671 = 47 \times 1993 \]
93671 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 95712 |
| Euler totient φ(n) | 91632 |
| Square | 8774256241 |
| Cube | 821893356350711 |
| Square root | 306.057184 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.3671 × |
93671 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand six hundred and seventy-one |
| Binary (base 2) | 10110110111100111 |
| Octal (base 8) | 266747 |
| Hexadecimal (base 16) | 16DE7 |
| Base 3 | 11202111022 |
| As time | 93671 seconds = 26 h 1 min 11 s |
Is 93671 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 8) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93671 a prime number?
No. 93671 = 47 × 1993, so it is divisible by 47.
What are the factors of 93671?
1, 47, 1993, 93671.
What is 93671 in binary?
10110110111100111 (hexadecimal 16DE7, octal 266747).
What is the square root of 93671?
About 306.0572.
Is 93671 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 93671?
93671 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 1993, the product of two primes.