The number 92952
92952 is a composite number with 24 divisors. Its prime factorisation is × × 1291. Divisors (24): 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72, 1291, 2582, 3873, 5164 … 92952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
92952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
92952 is composite. Its prime factorisation is
- 3
The divisors add up to 251940; without 92952 itself that is 158988, so 92952 is abundant (158988 is more than 92952). Euler's totient φ(92952) = 30960 numbers up to 92952 share no factor with it.
- 4
The digits of 92952 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 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92952 = 2^{3} \times 3^{2} \times 1291 \]92952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 251940 |
| Euler totient φ(n) | 30960 |
| Square | 8640074304 |
| Cube | 803112186705408 |
| Square root | 304.880304 (= 6√2582) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.2952 × |
92952 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand nine hundred and fifty-two |
| Binary (base 2) | 10110101100011000 |
| Octal (base 8) | 265430 |
| Hexadecimal (base 16) | 16B18 |
| Base 3 | 11201111200 |
| As time | 92952 seconds = 25 h 49 min 12 s |
Is 92952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (92952 ÷ 2 = 46476) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (92952 ÷ 3 = 30984) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (92952 ÷ 4 = 23238) | 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 | Yes (92952 ÷ 6 = 15492) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 (92952 ÷ 8 = 11619) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (92952 ÷ 9 = 10328) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (92952 ÷ 12 = 7746) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 92952 a prime number?
No. 92952 = × × 1291, so it is divisible by 2.
What are the factors of 92952?
1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72, 1291, 2582, 3873, 5164, 7746, 10328, 11619, 15492, 23238, 30984, 46476, 92952.
What is 92952 in binary?
10110101100011000 (hexadecimal 16B18, octal 265430).
What is the square root of 92952?
About 304.8803, exactly 6√2582.
Is 92952 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 92952?
It is a composite number with 24 divisors.