The number 4958
4958 is a composite number with 8 divisors. Its prime factorisation is 2 × 37 × 67. Divisors (8): 1, 2, 37, 67, 74, 134, 2479, 4958.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
4958 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
4958 is composite. Its prime factorisation is
- 3
The divisors add up to 7752; without 4958 itself that is 2794, so 4958 is deficient (2794 is less than 4958). Euler's totient φ(4958) = 2376 numbers up to 4958 share no factor with it.
- 4
The digits of 4958 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 46 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4958 = 2 \times 37 \times 67 \]
4958 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 7752 |
| Euler totient φ(n) | 2376 |
| Square | 24581764 |
| Cube | 121876385912 |
| Square root | 70.413067 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 46 |
| Scientific notation | 4.958 × |
4958 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and fifty-eight |
| Binary (base 2) | 1001101011110 |
| Octal (base 8) | 11536 |
| Hexadecimal (base 16) | 135E |
| Base 3 | 20210122 |
| As time | 4958 seconds = 1 h 22 min 38 s |
Is 4958 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4958 ÷ 2 = 2479) | 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 2) | 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 8) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4958 a prime number?
No. 4958 = 2 × 37 × 67, so it is divisible by 2.
What are the factors of 4958?
1, 2, 37, 67, 74, 134, 2479, 4958.
What is 4958 in binary?
1001101011110 (hexadecimal 135E, octal 11536).
What is the square root of 4958?
About 70.4131.
Is 4958 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 4958?
It is a composite number with 8 divisors.