The number 5013
5013 is a composite number with 6 divisors. Its prime factorisation is × 557. Divisors (6): 1, 3, 9, 557, 1671, 5013.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5013: a Harshad number: divisible by its digit sum 9.
- 2
5013 is composite. Its prime factorisation is
- 3
The divisors add up to 7254; without 5013 itself that is 2241, so 5013 is deficient (2241 is less than 5013). Euler's totient φ(5013) = 3336 numbers up to 5013 share no factor with it.
- 4
The digits of 5013 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 134 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5013 = 3^{2} \times 557 \]5013 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 7254 |
| Euler totient φ(n) | 3336 |
| Square | 25130169 |
| Cube | 125977537197 |
| Square root | 70.802542 (= 3√557) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 134 |
| Scientific notation | 5.013 × |
5013 in other forms
| Form | Value |
|---|---|
| In words | five thousand and thirteen |
| Binary (base 2) | 1001110010101 |
| Octal (base 8) | 11625 |
| Hexadecimal (base 16) | 1395 |
| Base 3 | 20212200 |
| As time | 5013 seconds = 1 h 23 min 33 s |
Is 5013 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 (5013 ÷ 3 = 1671) | 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 3) | 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 | Yes (5013 ÷ 9 = 557) | 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 8) | 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 5013 a prime number?
No. 5013 = × 557, so it is divisible by 3.
What are the factors of 5013?
1, 3, 9, 557, 1671, 5013.
What is 5013 in binary?
1001110010101 (hexadecimal 1395, octal 11625).
What is the square root of 5013?
About 70.8025, exactly 3√557.
Is 5013 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 5013?
5013 is a Harshad number: divisible by its digit sum 9.