The number 4905
4905 is a composite number with 12 divisors. Its prime factorisation is × 5 × 109. Divisors (12): 1, 3, 5, 9, 15, 45, 109, 327, 545, 981, 1635, 4905.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
4905 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
4905 is composite. Its prime factorisation is
- 3
The divisors add up to 8580; without 4905 itself that is 3675, so 4905 is deficient (3675 is less than 4905). Euler's totient φ(4905) = 2592 numbers up to 4905 share no factor with it.
- 4
The digits of 4905 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 165 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4905 = 3^{2} \times 5 \times 109 \]4905 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 8580 |
| Euler totient φ(n) | 2592 |
| Square | 24059025 |
| Cube | 118009517625 |
| Square root | 70.035705 (= 3√545) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 165 |
| Scientific notation | 4.905 × |
4905 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and five |
| Binary (base 2) | 1001100101001 |
| Octal (base 8) | 11451 |
| Hexadecimal (base 16) | 1329 |
| Base 3 | 20201200 |
| As time | 4905 seconds = 1 h 21 min 45 s |
Is 4905 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 (4905 ÷ 3 = 1635) | 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 | Yes (4905 ÷ 5 = 981) | 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 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 | Yes (4905 ÷ 9 = 545) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 4905 a prime number?
No. 4905 = × 5 × 109, so it is divisible by 3.
What are the factors of 4905?
1, 3, 5, 9, 15, 45, 109, 327, 545, 981, 1635, 4905.
What is 4905 in binary?
1001100101001 (hexadecimal 1329, octal 11451).
What is the square root of 4905?
About 70.0357, exactly 3√545.
Is 4905 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 4905?
It is a composite number with 12 divisors.