The number 48492
48492 is a composite number with 24 divisors. Its prime factorisation is × × 449. Divisors (24): 1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 108, 449, 898, 1347, 1796 … 48492.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48492: a Harshad number: divisible by its digit sum 27.
- 2
48492 is composite. Its prime factorisation is
- 3
The divisors add up to 126000; without 48492 itself that is 77508, so 48492 is abundant (77508 is more than 48492). Euler's totient φ(48492) = 16128 numbers up to 48492 share no factor with it.
- 4
The digits of 48492 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 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48492 = 2^{2} \times 3^{3} \times 449 \]48492 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 126000 |
| Euler totient φ(n) | 16128 |
| Square | 2351474064 |
| Cube | 114027680311488 |
| Square root | 220.208992 (= 6√1347) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.8492 × |
48492 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand four hundred and ninety-two |
| Binary (base 2) | 1011110101101100 |
| Octal (base 8) | 136554 |
| Hexadecimal (base 16) | BD6C |
| Base 3 | 2110112000 |
| As time | 48492 seconds = 13 h 28 min 12 s |
Is 48492 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48492 ÷ 2 = 24246) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (48492 ÷ 3 = 16164) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (48492 ÷ 4 = 12123) | 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 (48492 ÷ 6 = 8082) | 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 | Yes (48492 ÷ 9 = 5388) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (48492 ÷ 12 = 4041) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48492 a prime number?
No. 48492 = × × 449, so it is divisible by 2.
What are the factors of 48492?
1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 108, 449, 898, 1347, 1796, 2694, 4041, 5388, 8082, 12123, 16164, 24246, 48492.
What is 48492 in binary?
1011110101101100 (hexadecimal BD6C, octal 136554).
What is the square root of 48492?
About 220.2090, exactly 6√1347.
Is 48492 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 48492?
48492 is a Harshad number: divisible by its digit sum 27.