The number 48958
48958 is a composite number with 16 divisors. Its prime factorisation is 2 × 7 × 13 × 269. Divisors (16): 1, 2, 7, 13, 14, 26, 91, 182, 269, 538, 1883, 3497, 3766, 6994, 24479, 48958.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48958 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48958 is composite. Its prime factorisation is
- 3
The divisors add up to 90720; without 48958 itself that is 41762, so 48958 is deficient (41762 is less than 48958). Euler's totient φ(48958) = 19296 numbers up to 48958 share no factor with it.
- 4
The digits of 48958 add up to 34, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48958 = 2 \times 7 \times 13 \times 269 \]
48958 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 90720 |
| Euler totient φ(n) | 19296 |
| Square | 2396885764 |
| Cube | 117346733233912 |
| Square root | 221.264548 |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.8958 × |
48958 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and fifty-eight |
| Binary (base 2) | 1011111100111110 |
| Octal (base 8) | 137476 |
| Hexadecimal (base 16) | BF3E |
| Base 3 | 2111011021 |
| As time | 48958 seconds = 13 h 35 min 58 s |
Is 48958 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48958 ÷ 2 = 24479) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (48958 ÷ 7 = 6994) | 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 | No (remainder 7) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48958 a prime number?
No. 48958 = 2 × 7 × 13 × 269, so it is divisible by 2.
What are the factors of 48958?
1, 2, 7, 13, 14, 26, 91, 182, 269, 538, 1883, 3497, 3766, 6994, 24479, 48958.
What is 48958 in binary?
1011111100111110 (hexadecimal BF3E, octal 137476).
What is the square root of 48958?
About 221.2645.
Is 48958 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 48958?
It is a composite number with 16 divisors.