The number 4961
4961 is a composite number with 6 divisors. Its prime factorisation is Ć 41. Divisors (6): 1, 11, 41, 121, 451, 4961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
4961 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
4961 is composite. Its prime factorisation is
- 3
The divisors add up to 5586; without 4961 itself that is 625, so 4961 is deficient (625 is less than 4961). Euler's totient Ļ(4961) = 4400 numbers up to 4961 share no factor with it.
- 4
The digits of 4961 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 72 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4961 = 11^{2} \times 41 \]4961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 5586 |
| Euler totient Ļ(n) | 4400 |
| Square | 24611521 |
| Cube | 122097755681 |
| Square root | 70.434367 (= 11ā41) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 72 |
| Scientific notation | 4.961 Ć |
4961 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and sixty-one |
| Binary (base 2) | 1001101100001 |
| Octal (base 8) | 11541 |
| Hexadecimal (base 16) | 1361 |
| Base 3 | 20210202 |
| As time | 4961 seconds = 1 h 22 min 41 s |
Is 4961 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 | Yes (4961 Ć· 11 = 451) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4961 a prime number?
No. 4961 = Ć 41, so it is divisible by 11.
What are the factors of 4961?
1, 11, 41, 121, 451, 4961.
What is 4961 in binary?
1001101100001 (hexadecimal 1361, octal 11541).
What is the square root of 4961?
About 70.4344, exactly 11ā41.
Is 4961 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 4961?
It is a composite number with 6 divisors.