The number 92748
92748 is a composite number with 24 divisors. Its prime factorisation is × 3 × 59 × 131. Divisors (24): 1, 2, 3, 4, 6, 12, 59, 118, 131, 177, 236, 262, 354, 393, 524, 708 … 92748.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
92748 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
92748 is composite. Its prime factorisation is
- 3
The divisors add up to 221760; without 92748 itself that is 129012, so 92748 is abundant (129012 is more than 92748). Euler's totient φ(92748) = 30160 numbers up to 92748 share no factor with it.
- 4
The digits of 92748 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 190 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92748 = 2^{2} \times 3 \times 59 \times 131 \]92748 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 221760 |
| Euler totient φ(n) | 30160 |
| Square | 8602191504 |
| Cube | 797836057612992 |
| Square root | 304.545563 (= 2√23187) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 190 |
| Scientific notation | 9.2748 × |
92748 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand seven hundred and forty-eight |
| Binary (base 2) | 10110101001001100 |
| Octal (base 8) | 265114 |
| Hexadecimal (base 16) | 16A4C |
| Base 3 | 11201020010 |
| As time | 92748 seconds = 25 h 45 min 48 s |
Is 92748 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (92748 ÷ 2 = 46374) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (92748 ÷ 3 = 30916) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (92748 ÷ 4 = 23187) | 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 (92748 ÷ 6 = 15458) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (92748 ÷ 12 = 7729) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 92748 a prime number?
No. 92748 = × 3 × 59 × 131, so it is divisible by 2.
What are the factors of 92748?
1, 2, 3, 4, 6, 12, 59, 118, 131, 177, 236, 262, 354, 393, 524, 708, 786, 1572, 7729, 15458, 23187, 30916, 46374, 92748.
What is 92748 in binary?
10110101001001100 (hexadecimal 16A4C, octal 265114).
What is the square root of 92748?
About 304.5456, exactly 2√23187.
Is 92748 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 92748?
It is a composite number with 24 divisors.