The number 93692
93692 is a composite number with 12 divisors. Its prime factorisation is × 59 × 397. Divisors (12): 1, 2, 4, 59, 118, 236, 397, 794, 1588, 23423, 46846, 93692.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93692 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93692 is composite. Its prime factorisation is
- 3
The divisors add up to 167160; without 93692 itself that is 73468, so 93692 is deficient (73468 is less than 93692). Euler's totient φ(93692) = 45936 numbers up to 93692 share no factor with it.
- 4
The digits of 93692 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93692 = 2^{2} \times 59 \times 397 \]93692 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 167160 |
| Euler totient φ(n) | 45936 |
| Square | 8778190864 |
| Cube | 822446258429888 |
| Square root | 306.091490 (= 2√23423) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.3692 × |
93692 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand six hundred and ninety-two |
| Binary (base 2) | 10110110111111100 |
| Octal (base 8) | 266774 |
| Hexadecimal (base 16) | 16DFC |
| Base 3 | 11202112002 |
| As time | 93692 seconds = 26 h 1 min 32 s |
Is 93692 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93692 ÷ 2 = 46846) | 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 | Yes (93692 ÷ 4 = 23423) | 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 2) | 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 4) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93692 a prime number?
No. 93692 = × 59 × 397, so it is divisible by 2.
What are the factors of 93692?
1, 2, 4, 59, 118, 236, 397, 794, 1588, 23423, 46846, 93692.
What is 93692 in binary?
10110110111111100 (hexadecimal 16DFC, octal 266774).
What is the square root of 93692?
About 306.0915, exactly 2√23423.
Is 93692 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 93692?
It is a composite number with 12 divisors.