The number 93938
93938 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 3613. Divisors (8): 1, 2, 13, 26, 3613, 7226, 46969, 93938.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93938 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93938 is composite. Its prime factorisation is
- 3
The divisors add up to 151788; without 93938 itself that is 57850, so 93938 is deficient (57850 is less than 93938). Euler's totient φ(93938) = 43344 numbers up to 93938 share no factor with it.
- 4
The digits of 93938 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93938 = 2 \times 13 \times 3613 \]
93938 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 151788 |
| Euler totient φ(n) | 43344 |
| Square | 8824347844 |
| Cube | 828941587769672 |
| Square root | 306.493067 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 107 |
| Scientific notation | 9.3938 × |
93938 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and thirty-eight |
| Binary (base 2) | 10110111011110010 |
| Octal (base 8) | 267362 |
| Hexadecimal (base 16) | 16EF2 |
| Base 3 | 11202212012 |
| As time | 93938 seconds = 26 h 5 min 38 s |
Is 93938 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93938 ÷ 2 = 46969) | 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 | No (remainder 2) | 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 5) | 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 5) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93938 a prime number?
No. 93938 = 2 × 13 × 3613, so it is divisible by 2.
What are the factors of 93938?
1, 2, 13, 26, 3613, 7226, 46969, 93938.
What is 93938 in binary?
10110111011110010 (hexadecimal 16EF2, octal 267362).
What is the square root of 93938?
About 306.4931.
Is 93938 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 93938?
It is a composite number with 8 divisors.