The number 48959
48959 is a composite number with 4 divisors. Its prime factorisation is 173 × 283. Divisors (4): 1, 173, 283, 48959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48959: a semiprime: 173 × 283, the product of two primes.
- 2
48959 is composite. Its prime factorisation is
- 3
The divisors add up to 49416; without 48959 itself that is 457, so 48959 is deficient (457 is less than 48959). Euler's totient φ(48959) = 48504 numbers up to 48959 share no factor with it.
- 4
The digits of 48959 add up to 35, 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
\[ 48959 = 173 \times 283 \]
48959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 49416 |
| Euler totient φ(n) | 48504 |
| Square | 2396983681 |
| Cube | 117353924038079 |
| Square root | 221.266807 |
| Digit sum / digital root | 35 / 8 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.8959 × |
48959 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and fifty-nine |
| Binary (base 2) | 1011111100111111 |
| Octal (base 8) | 137477 |
| Hexadecimal (base 16) | BF3F |
| Base 3 | 2111011022 |
| As time | 48959 seconds = 13 h 35 min 59 s |
Is 48959 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 | No (remainder 2) | 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 5) | 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 7) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48959 a prime number?
No. 48959 = 173 × 283, so it is divisible by 173.
What are the factors of 48959?
1, 173, 283, 48959.
What is 48959 in binary?
1011111100111111 (hexadecimal BF3F, octal 137477).
What is the square root of 48959?
About 221.2668.
Is 48959 divisible by 3?
No. Its digits add up to 35, which is not a multiple of 3.
What is special about the number 48959?
48959 is a semiprime: 173 × 283, the product of two primes.