The number 93073
93073 is a composite number with 4 divisors. Its prime factorisation is 163 × 571. Divisors (4): 1, 163, 571, 93073.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93073: a semiprime: 163 × 571, the product of two primes.
- 2
93073 is composite. Its prime factorisation is
- 3
The divisors add up to 93808; without 93073 itself that is 735, so 93073 is deficient (735 is less than 93073). Euler's totient φ(93073) = 92340 numbers up to 93073 share no factor with it.
- 4
The digits of 93073 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93073 = 163 \times 571 \]
93073 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 93808 |
| Euler totient φ(n) | 92340 |
| Square | 8662583329 |
| Cube | 806252618180017 |
| Square root | 305.078678 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.3073 × |
93073 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand and seventy-three |
| Binary (base 2) | 10110101110010001 |
| Octal (base 8) | 265621 |
| Hexadecimal (base 16) | 16B91 |
| Base 3 | 11201200011 |
| As time | 93073 seconds = 25 h 51 min 13 s |
Is 93073 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93073 a prime number?
No. 93073 = 163 × 571, so it is divisible by 163.
What are the factors of 93073?
1, 163, 571, 93073.
What is 93073 in binary?
10110101110010001 (hexadecimal 16B91, octal 265621).
What is the square root of 93073?
About 305.0787.
Is 93073 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 93073?
93073 is a semiprime: 163 × 571, the product of two primes.