The number 93906
93906 is a composite number with 32 divisors. Its prime factorisation is 2 × × 37 × 47. Divisors (32): 1, 2, 3, 6, 9, 18, 27, 37, 47, 54, 74, 94, 111, 141, 222, 282 … 93906.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93906: a Harshad number: divisible by its digit sum 27.
- 2
93906 is composite. Its prime factorisation is
- 3
The divisors add up to 218880; without 93906 itself that is 124974, so 93906 is abundant (124974 is more than 93906). Euler's totient φ(93906) = 29808 numbers up to 93906 share no factor with it.
- 4
The digits of 93906 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93906 = 2 \times 3^{3} \times 37 \times 47 \]93906 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 218880 |
| Euler totient φ(n) | 29808 |
| Square | 8818336836 |
| Cube | 828094738921416 |
| Square root | 306.440859 (= 3√10434) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.3906 × |
93906 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and six |
| Binary (base 2) | 10110111011010010 |
| Octal (base 8) | 267322 |
| Hexadecimal (base 16) | 16ED2 |
| Base 3 | 11202211000 |
| As time | 93906 seconds = 26 h 5 min 6 s |
Is 93906 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93906 ÷ 2 = 46953) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (93906 ÷ 3 = 31302) | 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 | Yes (93906 ÷ 6 = 15651) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (93906 ÷ 9 = 10434) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93906 a prime number?
No. 93906 = 2 × × 37 × 47, so it is divisible by 2.
What are the factors of 93906?
1, 2, 3, 6, 9, 18, 27, 37, 47, 54, 74, 94, 111, 141, 222, 282, 333, 423, 666, 846, 999, 1269, 1739, 1998, 2538, 3478, 5217, 10434, 15651, 31302, 46953, 93906.
What is 93906 in binary?
10110111011010010 (hexadecimal 16ED2, octal 267322).
What is the square root of 93906?
About 306.4409, exactly 3√10434.
Is 93906 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 93906?
93906 is a Harshad number: divisible by its digit sum 27.