The number 93071
93071 is a composite number with 4 divisors. Its prime factorisation is 11 × 8461. Divisors (4): 1, 11, 8461, 93071.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93071: a semiprime: 11 × 8461, the product of two primes.
- 2
93071 is composite. Its prime factorisation is
- 3
The divisors add up to 101544; without 93071 itself that is 8473, so 93071 is deficient (8473 is less than 93071). Euler's totient φ(93071) = 84600 numbers up to 93071 share no factor with it.
- 4
The digits of 93071 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93071 = 11 \times 8461 \]
93071 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 101544 |
| Euler totient φ(n) | 84600 |
| Square | 8662211041 |
| Cube | 806200643796911 |
| Square root | 305.075401 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.3071 × |
93071 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand and seventy-one |
| Binary (base 2) | 10110101110001111 |
| Octal (base 8) | 265617 |
| Hexadecimal (base 16) | 16B8F |
| Base 3 | 11201200002 |
| As time | 93071 seconds = 25 h 51 min 11 s |
Is 93071 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 6) | 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 2) | 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 | Yes (93071 ÷ 11 = 8461) | 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 93071 a prime number?
No. 93071 = 11 × 8461, so it is divisible by 11.
What are the factors of 93071?
1, 11, 8461, 93071.
What is 93071 in binary?
10110101110001111 (hexadecimal 16B8F, octal 265617).
What is the square root of 93071?
About 305.0754.
Is 93071 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 93071?
93071 is a semiprime: 11 × 8461, the product of two primes.