The number 48992
48992 is a composite number with 12 divisors. Its prime factorisation is × 1531. Divisors (12): 1, 2, 4, 8, 16, 32, 1531, 3062, 6124, 12248, 24496, 48992.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48992: a Harshad number: divisible by its digit sum 32.
- 2
48992 is composite. Its prime factorisation is
- 3
The divisors add up to 96516; without 48992 itself that is 47524, so 48992 is deficient (47524 is less than 48992). Euler's totient φ(48992) = 24480 numbers up to 48992 share no factor with it.
- 4
The digits of 48992 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48992 = 2^{5} \times 1531 \]48992 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 96516 |
| Euler totient φ(n) | 24480 |
| Square | 2400216064 |
| Cube | 117591385407488 |
| Square root | 221.341365 (= 4√3062) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.8992 × |
48992 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and ninety-two |
| Binary (base 2) | 1011111101100000 |
| Octal (base 8) | 137540 |
| Hexadecimal (base 16) | BF60 |
| Base 3 | 2111012112 |
| As time | 48992 seconds = 13 h 36 min 32 s |
Is 48992 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48992 ÷ 2 = 24496) | 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 (48992 ÷ 4 = 12248) | 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 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 (48992 ÷ 8 = 6124) | 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 9) | 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 48992 a prime number?
No. 48992 = × 1531, so it is divisible by 2.
What are the factors of 48992?
1, 2, 4, 8, 16, 32, 1531, 3062, 6124, 12248, 24496, 48992.
What is 48992 in binary?
1011111101100000 (hexadecimal BF60, octal 137540).
What is the square root of 48992?
About 221.3414, exactly 4√3062.
Is 48992 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 48992?
48992 is a Harshad number: divisible by its digit sum 32.