The number 48938
48938 is a composite number with 4 divisors. Its prime factorisation is 2 × 24469. Divisors (4): 1, 2, 24469, 48938.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48938: a semiprime: 2 × 24469, the product of two primes.
- 2
48938 is composite. Its prime factorisation is
- 3
The divisors add up to 73410; without 48938 itself that is 24472, so 48938 is deficient (24472 is less than 48938). Euler's totient φ(48938) = 24468 numbers up to 48938 share no factor with it.
- 4
The digits of 48938 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
\[ 48938 = 2 \times 24469 \]
48938 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 73410 |
| Euler totient φ(n) | 24468 |
| Square | 2394927844 |
| Cube | 117202978829672 |
| Square root | 221.219348 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.8938 × |
48938 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and thirty-eight |
| Binary (base 2) | 1011111100101010 |
| Octal (base 8) | 137452 |
| Hexadecimal (base 16) | BF2A |
| Base 3 | 2111010112 |
| As time | 48938 seconds = 13 h 35 min 38 s |
Is 48938 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48938 ÷ 2 = 24469) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 1) | 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 2) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48938 a prime number?
No. 48938 = 2 × 24469, so it is divisible by 2.
What are the factors of 48938?
1, 2, 24469, 48938.
What is 48938 in binary?
1011111100101010 (hexadecimal BF2A, octal 137452).
What is the square root of 48938?
About 221.2193.
Is 48938 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 48938?
48938 is a semiprime: 2 × 24469, the product of two primes.