The number 48939
48939 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 1483. Divisors (8): 1, 3, 11, 33, 1483, 4449, 16313, 48939.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48939: a Harshad number: divisible by its digit sum 33.
- 2
48939 is composite. Its prime factorisation is
- 3
The divisors add up to 71232; without 48939 itself that is 22293, so 48939 is deficient (22293 is less than 48939). Euler's totient φ(48939) = 29640 numbers up to 48939 share no factor with it.
- 4
The digits of 48939 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48939 = 3 \times 11 \times 1483 \]
48939 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 71232 |
| Euler totient φ(n) | 29640 |
| Square | 2395025721 |
| Cube | 117210163760019 |
| Square root | 221.221608 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.8939 × |
48939 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and thirty-nine |
| Binary (base 2) | 1011111100101011 |
| Octal (base 8) | 137453 |
| Hexadecimal (base 16) | BF2B |
| Base 3 | 2111010120 |
| As time | 48939 seconds = 13 h 35 min 39 s |
Is 48939 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (48939 ÷ 3 = 16313) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (48939 ÷ 11 = 4449) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48939 a prime number?
No. 48939 = 3 × 11 × 1483, so it is divisible by 3.
What are the factors of 48939?
1, 3, 11, 33, 1483, 4449, 16313, 48939.
What is 48939 in binary?
1011111100101011 (hexadecimal BF2B, octal 137453).
What is the square root of 48939?
About 221.2216.
Is 48939 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 48939?
48939 is a Harshad number: divisible by its digit sum 33.