The number 93952
93952 is a composite number with 18 divisors. Its prime factorisation is × 367. Divisors (18): 1, 2, 4, 8, 16, 32, 64, 128, 256, 367, 734, 1468, 2936, 5872, 11744, 23488 … 93952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93952 is composite. Its prime factorisation is
- 3
The divisors add up to 188048; without 93952 itself that is 94096, so 93952 is abundant (94096 is more than 93952). Euler's totient φ(93952) = 46848 numbers up to 93952 share no factor with it.
- 4
The digits of 93952 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93952 = 2^{8} \times 367 \]93952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 188048 |
| Euler totient φ(n) | 46848 |
| Square | 8826978304 |
| Cube | 829312265617408 |
| Square root | 306.515905 (= 16√367) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.3952 × |
93952 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and fifty-two |
| Binary (base 2) | 10110111100000000 |
| Octal (base 8) | 267400 |
| Hexadecimal (base 16) | 16F00 |
| Base 3 | 11202212201 |
| As time | 93952 seconds = 26 h 5 min 52 s |
Is 93952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93952 ÷ 2 = 46976) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (93952 ÷ 4 = 23488) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 | Yes (93952 ÷ 8 = 11744) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93952 a prime number?
No. 93952 = × 367, so it is divisible by 2.
What are the factors of 93952?
1, 2, 4, 8, 16, 32, 64, 128, 256, 367, 734, 1468, 2936, 5872, 11744, 23488, 46976, 93952.
What is 93952 in binary?
10110111100000000 (hexadecimal 16F00, octal 267400).
What is the square root of 93952?
About 306.5159, exactly 16√367.
Is 93952 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 93952?
It is a composite number with 18 divisors.