The number 93706
93706 is a composite number with 4 divisors. Its prime factorisation is 2 × 46853. Divisors (4): 1, 2, 46853, 93706.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93706: a semiprime: 2 × 46853, the product of two primes.
- 2
93706 is composite. Its prime factorisation is
- 3
The divisors add up to 140562; without 93706 itself that is 46856, so 93706 is deficient (46856 is less than 93706). Euler's totient φ(93706) = 46852 numbers up to 93706 share no factor with it.
- 4
The digits of 93706 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 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93706 = 2 \times 46853 \]
93706 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 140562 |
| Euler totient φ(n) | 46852 |
| Square | 8780814436 |
| Cube | 822814997539816 |
| Square root | 306.114358 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.3706 × |
93706 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand seven hundred and six |
| Binary (base 2) | 10110111000001010 |
| Octal (base 8) | 267012 |
| Hexadecimal (base 16) | 16E0A |
| Base 3 | 11202112121 |
| As time | 93706 seconds = 26 h 1 min 46 s |
Is 93706 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93706 ÷ 2 = 46853) | 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 2) | 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 4) | 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 2) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93706 a prime number?
No. 93706 = 2 × 46853, so it is divisible by 2.
What are the factors of 93706?
1, 2, 46853, 93706.
What is 93706 in binary?
10110111000001010 (hexadecimal 16E0A, octal 267012).
What is the square root of 93706?
About 306.1144.
Is 93706 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 93706?
93706 is a semiprime: 2 × 46853, the product of two primes.