The number 93067
93067 is a composite number with 4 divisors. Its prime factorisation is 13 × 7159. Divisors (4): 1, 13, 7159, 93067.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93067: a semiprime: 13 × 7159, the product of two primes.
- 2
93067 is composite. Its prime factorisation is
- 3
The divisors add up to 100240; without 93067 itself that is 7173, so 93067 is deficient (7173 is less than 93067). Euler's totient φ(93067) = 85896 numbers up to 93067 share no factor with it.
- 4
The digits of 93067 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 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93067 = 13 \times 7159 \]
93067 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 100240 |
| Euler totient φ(n) | 85896 |
| Square | 8661466489 |
| Cube | 806096701731763 |
| Square root | 305.068845 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.3067 × |
93067 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand and sixty-seven |
| Binary (base 2) | 10110101110001011 |
| Octal (base 8) | 265613 |
| Hexadecimal (base 16) | 16B8B |
| Base 3 | 11201122221 |
| As time | 93067 seconds = 25 h 51 min 7 s |
Is 93067 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 2) | 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 2) | 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 3) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 93067 a prime number?
No. 93067 = 13 × 7159, so it is divisible by 13.
What are the factors of 93067?
1, 13, 7159, 93067.
What is 93067 in binary?
10110101110001011 (hexadecimal 16B8B, octal 265613).
What is the square root of 93067?
About 305.0688.
Is 93067 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 93067?
93067 is a semiprime: 13 × 7159, the product of two primes.