The number 93948
93948 is a composite number with 12 divisors. Its prime factorisation is × 3 × 7829. Divisors (12): 1, 2, 3, 4, 6, 12, 7829, 15658, 23487, 31316, 46974, 93948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93948 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93948 is composite. Its prime factorisation is
- 3
The divisors add up to 219240; without 93948 itself that is 125292, so 93948 is abundant (125292 is more than 93948). Euler's totient φ(93948) = 31312 numbers up to 93948 share no factor with it.
- 4
The digits of 93948 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93948 = 2^{2} \times 3 \times 7829 \]93948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 219240 |
| Euler totient φ(n) | 31312 |
| Square | 8826226704 |
| Cube | 829206346387392 |
| Square root | 306.509380 (= 2√23487) |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.3948 × |
93948 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and forty-eight |
| Binary (base 2) | 10110111011111100 |
| Octal (base 8) | 267374 |
| Hexadecimal (base 16) | 16EFC |
| Base 3 | 11202212120 |
| As time | 93948 seconds = 26 h 5 min 48 s |
Is 93948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93948 ÷ 2 = 46974) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (93948 ÷ 3 = 31316) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (93948 ÷ 4 = 23487) | 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 | Yes (93948 ÷ 6 = 15658) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (93948 ÷ 12 = 7829) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93948 a prime number?
No. 93948 = × 3 × 7829, so it is divisible by 2.
What are the factors of 93948?
1, 2, 3, 4, 6, 12, 7829, 15658, 23487, 31316, 46974, 93948.
What is 93948 in binary?
10110111011111100 (hexadecimal 16EFC, octal 267374).
What is the square root of 93948?
About 306.5094, exactly 2√23487.
Is 93948 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 93948?
It is a composite number with 12 divisors.