The number 93908
93908 is a composite number with 12 divisors. Its prime factorisation is × 17 × 1381. Divisors (12): 1, 2, 4, 17, 34, 68, 1381, 2762, 5524, 23477, 46954, 93908.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93908 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93908 is composite. Its prime factorisation is
- 3
The divisors add up to 174132; without 93908 itself that is 80224, so 93908 is deficient (80224 is less than 93908). Euler's totient φ(93908) = 44160 numbers up to 93908 share no factor with it.
- 4
The digits of 93908 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 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93908 = 2^{2} \times 17 \times 1381 \]93908 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 174132 |
| Euler totient φ(n) | 44160 |
| Square | 8818712464 |
| Cube | 828147650069312 |
| Square root | 306.444122 (= 2√23477) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.3908 × |
93908 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and eight |
| Binary (base 2) | 10110111011010100 |
| Octal (base 8) | 267324 |
| Hexadecimal (base 16) | 16ED4 |
| Base 3 | 11202211002 |
| As time | 93908 seconds = 26 h 5 min 8 s |
Is 93908 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93908 ÷ 2 = 46954) | 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 (93908 ÷ 4 = 23477) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 93908 a prime number?
No. 93908 = × 17 × 1381, so it is divisible by 2.
What are the factors of 93908?
1, 2, 4, 17, 34, 68, 1381, 2762, 5524, 23477, 46954, 93908.
What is 93908 in binary?
10110111011010100 (hexadecimal 16ED4, octal 267324).
What is the square root of 93908?
About 306.4441, exactly 2√23477.
Is 93908 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 93908?
It is a composite number with 12 divisors.