The number 48932
48932 is a composite number with 12 divisors. Its prime factorisation is × 13 × 941. Divisors (12): 1, 2, 4, 13, 26, 52, 941, 1882, 3764, 12233, 24466, 48932.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48932: a Harshad number: divisible by its digit sum 26.
- 2
48932 is composite. Its prime factorisation is
- 3
The divisors add up to 92316; without 48932 itself that is 43384, so 48932 is deficient (43384 is less than 48932). Euler's totient φ(48932) = 22560 numbers up to 48932 share no factor with it.
- 4
The digits of 48932 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48932 = 2^{2} \times 13 \times 941 \]48932 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 92316 |
| Euler totient φ(n) | 22560 |
| Square | 2394340624 |
| Cube | 117159875413568 |
| Square root | 221.205787 (= 2√12233) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.8932 × |
48932 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and thirty-two |
| Binary (base 2) | 1011111100100100 |
| Octal (base 8) | 137444 |
| Hexadecimal (base 16) | BF24 |
| Base 3 | 2111010022 |
| As time | 48932 seconds = 13 h 35 min 32 s |
Is 48932 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48932 ÷ 2 = 24466) | 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 (48932 ÷ 4 = 12233) | 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 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48932 a prime number?
No. 48932 = × 13 × 941, so it is divisible by 2.
What are the factors of 48932?
1, 2, 4, 13, 26, 52, 941, 1882, 3764, 12233, 24466, 48932.
What is 48932 in binary?
1011111100100100 (hexadecimal BF24, octal 137444).
What is the square root of 48932?
About 221.2058, exactly 2√12233.
Is 48932 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 48932?
48932 is a Harshad number: divisible by its digit sum 26.