The number 92752
92752 is a composite number with 40 divisors. Its prime factorisation is × 11 × 17 × 31. Divisors (40): 1, 2, 4, 8, 11, 16, 17, 22, 31, 34, 44, 62, 68, 88, 124, 136 … 92752.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
92752 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
92752 is composite. Its prime factorisation is
- 3
The divisors add up to 214272; without 92752 itself that is 121520, so 92752 is abundant (121520 is more than 92752). Euler's totient φ(92752) = 38400 numbers up to 92752 share no factor with it.
- 4
The digits of 92752 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92752 = 2^{4} \times 11 \times 17 \times 31 \]92752 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 214272 |
| Euler totient φ(n) | 38400 |
| Square | 8602933504 |
| Cube | 797939288363008 |
| Square root | 304.552130 (= 4√5797) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.2752 × |
92752 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand seven hundred and fifty-two |
| Binary (base 2) | 10110101001010000 |
| Octal (base 8) | 265120 |
| Hexadecimal (base 16) | 16A50 |
| Base 3 | 11201020021 |
| As time | 92752 seconds = 25 h 45 min 52 s |
Is 92752 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (92752 ÷ 2 = 46376) | 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 (92752 ÷ 4 = 23188) | 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 2) | 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 (92752 ÷ 8 = 11594) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 | Yes (92752 ÷ 11 = 8432) | 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 92752 a prime number?
No. 92752 = × 11 × 17 × 31, so it is divisible by 2.
What are the factors of 92752?
1, 2, 4, 8, 11, 16, 17, 22, 31, 34, 44, 62, 68, 88, 124, 136, 176, 187, 248, 272, 341, 374, 496, 527, 682, 748, 1054, 1364, 1496, 2108, 2728, 2992, 4216, 5456, 5797, 8432, 11594, 23188, 46376, 92752.
What is 92752 in binary?
10110101001010000 (hexadecimal 16A50, octal 265120).
What is the square root of 92752?
About 304.5521, exactly 4√5797.
Is 92752 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 92752?
It is a composite number with 40 divisors.