The number 93681
93681 is a composite number with 12 divisors. Its prime factorisation is × 7 × 1487. Divisors (12): 1, 3, 7, 9, 21, 63, 1487, 4461, 10409, 13383, 31227, 93681.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93681 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93681 is composite. Its prime factorisation is
- 3
The divisors add up to 154752; without 93681 itself that is 61071, so 93681 is deficient (61071 is less than 93681). Euler's totient φ(93681) = 53496 numbers up to 93681 share no factor with it.
- 4
The digits of 93681 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93681 = 3^{2} \times 7 \times 1487 \]93681 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 154752 |
| Euler totient φ(n) | 53496 |
| Square | 8776129761 |
| Cube | 822156612140241 |
| Square root | 306.073521 (= 3√10409) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.3681 × |
93681 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand six hundred and eighty-one |
| Binary (base 2) | 10110110111110001 |
| Octal (base 8) | 266761 |
| Hexadecimal (base 16) | 16DF1 |
| Base 3 | 11202111200 |
| As time | 93681 seconds = 26 h 1 min 21 s |
Is 93681 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 | Yes (93681 ÷ 3 = 31227) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (93681 ÷ 7 = 13383) | 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 | Yes (93681 ÷ 9 = 10409) | 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 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93681 a prime number?
No. 93681 = × 7 × 1487, so it is divisible by 3.
What are the factors of 93681?
1, 3, 7, 9, 21, 63, 1487, 4461, 10409, 13383, 31227, 93681.
What is 93681 in binary?
10110110111110001 (hexadecimal 16DF1, octal 266761).
What is the square root of 93681?
About 306.0735, exactly 3√10409.
Is 93681 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 93681?
It is a composite number with 12 divisors.