The number 4941
4941 is a composite number with 10 divisors. Its prime factorisation is × 61. Divisors (10): 1, 3, 9, 27, 61, 81, 183, 549, 1647, 4941.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
4941 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
4941 is composite. Its prime factorisation is
- 3
The divisors add up to 7502; without 4941 itself that is 2561, so 4941 is deficient (2561 is less than 4941). Euler's totient φ(4941) = 3240 numbers up to 4941 share no factor with it.
- 4
The digits of 4941 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 134 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4941 = 3^{4} \times 61 \]4941 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 7502 |
| Euler totient φ(n) | 3240 |
| Square | 24413481 |
| Cube | 120627009621 |
| Square root | 70.292247 (= 9√61) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 134 |
| Scientific notation | 4.941 × |
4941 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and forty-one |
| Binary (base 2) | 1001101001101 |
| Octal (base 8) | 11515 |
| Hexadecimal (base 16) | 134D |
| Base 3 | 20210000 |
| As time | 4941 seconds = 1 h 22 min 21 s |
Is 4941 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 (4941 ÷ 3 = 1647) | 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 1) | 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 | Yes (4941 ÷ 9 = 549) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 4941 a prime number?
No. 4941 = × 61, so it is divisible by 3.
What are the factors of 4941?
1, 3, 9, 27, 61, 81, 183, 549, 1647, 4941.
What is 4941 in binary?
1001101001101 (hexadecimal 134D, octal 11515).
What is the square root of 4941?
About 70.2922, exactly 9√61.
Is 4941 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 4941?
It is a composite number with 10 divisors.