The number 48957
48957 is a composite number with 4 divisors. Its prime factorisation is 3 × 16319. Divisors (4): 1, 3, 16319, 48957.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48957: a semiprime: 3 × 16319, the product of two primes.
- 2
48957 is composite. Its prime factorisation is
- 3
The divisors add up to 65280; without 48957 itself that is 16323, so 48957 is deficient (16323 is less than 48957). Euler's totient φ(48957) = 32636 numbers up to 48957 share no factor with it.
- 4
The digits of 48957 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48957 = 3 \times 16319 \]
48957 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 65280 |
| Euler totient φ(n) | 32636 |
| Square | 2396787849 |
| Cube | 117339542723493 |
| Square root | 221.262288 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.8957 × |
48957 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and fifty-seven |
| Binary (base 2) | 1011111100111101 |
| Octal (base 8) | 137475 |
| Hexadecimal (base 16) | BF3D |
| Base 3 | 2111011020 |
| As time | 48957 seconds = 13 h 35 min 57 s |
Is 48957 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 (48957 ÷ 3 = 16319) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 5) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48957 a prime number?
No. 48957 = 3 × 16319, so it is divisible by 3.
What are the factors of 48957?
1, 3, 16319, 48957.
What is 48957 in binary?
1011111100111101 (hexadecimal BF3D, octal 137475).
What is the square root of 48957?
About 221.2623.
Is 48957 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 48957?
48957 is a semiprime: 3 × 16319, the product of two primes.