The number 48942
48942 is a composite number with 12 divisors. Its prime factorisation is 2 × × 2719. Divisors (12): 1, 2, 3, 6, 9, 18, 2719, 5438, 8157, 16314, 24471, 48942.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48942 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48942 is composite. Its prime factorisation is
- 3
The divisors add up to 106080; without 48942 itself that is 57138, so 48942 is abundant (57138 is more than 48942). Euler's totient φ(48942) = 16308 numbers up to 48942 share no factor with it.
- 4
The digits of 48942 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 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48942 = 2 \times 3^{2} \times 2719 \]48942 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 106080 |
| Euler totient φ(n) | 16308 |
| Square | 2395319364 |
| Cube | 117231720312888 |
| Square root | 221.228389 (= 3√5438) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.8942 × |
48942 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and forty-two |
| Binary (base 2) | 1011111100101110 |
| Octal (base 8) | 137456 |
| Hexadecimal (base 16) | BF2E |
| Base 3 | 2111010200 |
| As time | 48942 seconds = 13 h 35 min 42 s |
Is 48942 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48942 ÷ 2 = 24471) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (48942 ÷ 3 = 16314) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 (48942 ÷ 6 = 8157) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (48942 ÷ 9 = 5438) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48942 a prime number?
No. 48942 = 2 × × 2719, so it is divisible by 2.
What are the factors of 48942?
1, 2, 3, 6, 9, 18, 2719, 5438, 8157, 16314, 24471, 48942.
What is 48942 in binary?
1011111100101110 (hexadecimal BF2E, octal 137456).
What is the square root of 48942?
About 221.2284, exactly 3√5438.
Is 48942 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 48942?
It is a composite number with 12 divisors.