The number 4901
4901 is a composite number with 6 divisors. Its prime factorisation is Ć 29. Divisors (6): 1, 13, 29, 169, 377, 4901.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
4901 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
4901 is composite. Its prime factorisation is
- 3
The divisors add up to 5490; without 4901 itself that is 589, so 4901 is deficient (589 is less than 4901). Euler's totient Ļ(4901) = 4368 numbers up to 4901 share no factor with it.
- 4
The digits of 4901 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 134 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4901 = 13^{2} \times 29 \]4901 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 5490 |
| Euler totient Ļ(n) | 4368 |
| Square | 24019801 |
| Cube | 117721044701 |
| Square root | 70.007142 (= 13ā29) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 134 |
| Scientific notation | 4.901 Ć |
4901 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and one |
| Binary (base 2) | 1001100100101 |
| Octal (base 8) | 11445 |
| Hexadecimal (base 16) | 1325 |
| Base 3 | 20201112 |
| As time | 4901 seconds = 1 h 21 min 41 s |
Is 4901 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 1) | 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 | No (remainder 5) | 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 6) | 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 4901 a prime number?
No. 4901 = Ć 29, so it is divisible by 13.
What are the factors of 4901?
1, 13, 29, 169, 377, 4901.
What is 4901 in binary?
1001100100101 (hexadecimal 1325, octal 11445).
What is the square root of 4901?
About 70.0071, exactly 13ā29.
Is 4901 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 4901?
It is a composite number with 6 divisors.