The number 4913
4913 is a perfect cube (). Its prime factorisation is . Divisors (4): 1, 17, 289, 4913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4913: a perfect cube (); a Harshad number: divisible by its digit sum 17.
- 2
4913 is composite. Its prime factorisation is
- 3
The divisors add up to 5220; without 4913 itself that is 307, so 4913 is deficient (307 is less than 4913). Euler's totient φ(4913) = 4624 numbers up to 4913 share no factor with it.
- 4
The digits of 4913 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 134 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4913 = 17^{3} \]4913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5220 |
| Euler totient φ(n) | 4624 |
| Square | 24137569 |
| Cube | 118587876497 |
| Square root | 70.092796 (= 17√17) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 134 |
| Scientific notation | 4.913 × |
| Perfect power |
4913 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and thirteen |
| Binary (base 2) | 1001100110001 |
| Octal (base 8) | 11461 |
| Hexadecimal (base 16) | 1331 |
| Base 3 | 20201222 |
| As time | 4913 seconds = 1 h 21 min 53 s |
Is 4913 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 3) | 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 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 4913 a prime number?
No. 4913 = , so it is divisible by 17.
What are the factors of 4913?
1, 17, 289, 4913.
What is 4913 in binary?
1001100110001 (hexadecimal 1331, octal 11461).
What is the square root of 4913?
About 70.0928, exactly 17√17.
Is 4913 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 4913?
4913 is a perfect cube (); a Harshad number: divisible by its digit sum 17.