The number 92732
92732 is a composite number with 12 divisors. Its prime factorisation is × 97 × 239. Divisors (12): 1, 2, 4, 97, 194, 239, 388, 478, 956, 23183, 46366, 92732.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
92732 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
92732 is composite. Its prime factorisation is
- 3
The divisors add up to 164640; without 92732 itself that is 71908, so 92732 is deficient (71908 is less than 92732). Euler's totient φ(92732) = 45696 numbers up to 92732 share no factor with it.
- 4
The digits of 92732 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92732 = 2^{2} \times 97 \times 239 \]92732 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 164640 |
| Euler totient φ(n) | 45696 |
| Square | 8599223824 |
| Cube | 797423223647168 |
| Square root | 304.519293 (= 2√23183) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 89 |
| Scientific notation | 9.2732 × |
92732 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand seven hundred and thirty-two |
| Binary (base 2) | 10110101000111100 |
| Octal (base 8) | 265074 |
| Hexadecimal (base 16) | 16A3C |
| Base 3 | 11201012112 |
| As time | 92732 seconds = 25 h 45 min 32 s |
Is 92732 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (92732 ÷ 2 = 46366) | 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 | Yes (92732 ÷ 4 = 23183) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 5) | 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 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 92732 a prime number?
No. 92732 = × 97 × 239, so it is divisible by 2.
What are the factors of 92732?
1, 2, 4, 97, 194, 239, 388, 478, 956, 23183, 46366, 92732.
What is 92732 in binary?
10110101000111100 (hexadecimal 16A3C, octal 265074).
What is the square root of 92732?
About 304.5193, exactly 2√23183.
Is 92732 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 92732?
It is a composite number with 12 divisors.