The number 4939
4939 is a composite number with 4 divisors. Its prime factorisation is 11 × 449. Divisors (4): 1, 11, 449, 4939.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4939: a semiprime: 11 × 449, the product of two primes.
- 2
4939 is composite. Its prime factorisation is
- 3
The divisors add up to 5400; without 4939 itself that is 461, so 4939 is deficient (461 is less than 4939). Euler's totient φ(4939) = 4480 numbers up to 4939 share no factor with it.
- 4
The digits of 4939 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 134 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4939 = 11 \times 449 \]
4939 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5400 |
| Euler totient φ(n) | 4480 |
| Square | 24393721 |
| Cube | 120480588019 |
| Square root | 70.278019 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 134 |
| Scientific notation | 4.939 × |
4939 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and thirty-nine |
| Binary (base 2) | 1001101001011 |
| Octal (base 8) | 11513 |
| Hexadecimal (base 16) | 134B |
| Base 3 | 20202221 |
| As time | 4939 seconds = 1 h 22 min 19 s |
Is 4939 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (4939 ÷ 11 = 449) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4939 a prime number?
No. 4939 = 11 × 449, so it is divisible by 11.
What are the factors of 4939?
1, 11, 449, 4939.
What is 4939 in binary?
1001101001011 (hexadecimal 134B, octal 11513).
What is the square root of 4939?
About 70.2780.
Is 4939 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 4939?
4939 is a semiprime: 11 × 449, the product of two primes.