The number 4904
4904 is a composite number with 8 divisors. Its prime factorisation is × 613. Divisors (8): 1, 2, 4, 8, 613, 1226, 2452, 4904.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
4904 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
4904 is composite. Its prime factorisation is
- 3
The divisors add up to 9210; without 4904 itself that is 4306, so 4904 is deficient (4306 is less than 4904). Euler's totient φ(4904) = 2448 numbers up to 4904 share no factor with it.
- 4
The digits of 4904 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4904 = 2^{3} \times 613 \]4904 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 9210 |
| Euler totient φ(n) | 2448 |
| Square | 24049216 |
| Cube | 117937355264 |
| Square root | 70.028566 (= 2√1226) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 41 |
| Scientific notation | 4.904 × |
4904 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and four |
| Binary (base 2) | 1001100101000 |
| Octal (base 8) | 11450 |
| Hexadecimal (base 16) | 1328 |
| Base 3 | 20201122 |
| As time | 4904 seconds = 1 h 21 min 44 s |
Is 4904 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4904 ÷ 2 = 2452) | 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 | Yes (4904 ÷ 4 = 1226) | 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 2) | 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 | Yes (4904 ÷ 8 = 613) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4904 a prime number?
No. 4904 = × 613, so it is divisible by 2.
What are the factors of 4904?
1, 2, 4, 8, 613, 1226, 2452, 4904.
What is 4904 in binary?
1001100101000 (hexadecimal 1328, octal 11450).
What is the square root of 4904?
About 70.0286, exactly 2√1226.
Is 4904 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 4904?
It is a composite number with 8 divisors.