The number 5060
5060 is a composite number with 24 divisors. Its prime factorisation is × 5 × 11 × 23. Divisors (24): 1, 2, 4, 5, 10, 11, 20, 22, 23, 44, 46, 55, 92, 110, 115, 220 … 5060.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5060: a Harshad number: divisible by its digit sum 11.
- 2
5060 is composite. Its prime factorisation is
- 3
The divisors add up to 12096; without 5060 itself that is 7036, so 5060 is abundant (7036 is more than 5060). Euler's totient φ(5060) = 1760 numbers up to 5060 share no factor with it.
- 4
The digits of 5060 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5060 = 2^{2} \times 5 \times 11 \times 23 \]5060 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 12096 |
| Euler totient φ(n) | 1760 |
| Square | 25603600 |
| Cube | 129554216000 |
| Square root | 71.133677 (= 2√1265) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 41 |
| Scientific notation | 5.06 × |
5060 in other forms
| Form | Value |
|---|---|
| In words | five thousand and sixty |
| Binary (base 2) | 1001111000100 |
| Octal (base 8) | 11704 |
| Hexadecimal (base 16) | 13C4 |
| Base 3 | 20221102 |
| As time | 5060 seconds = 1 h 24 min 20 s |
Is 5060 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5060 ÷ 2 = 2530) | 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 (5060 ÷ 4 = 1265) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (5060 ÷ 5 = 1012) | 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 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (5060 ÷ 10 = 506) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (5060 ÷ 11 = 460) | 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 5060 a prime number?
No. 5060 = × 5 × 11 × 23, so it is divisible by 2.
What are the factors of 5060?
1, 2, 4, 5, 10, 11, 20, 22, 23, 44, 46, 55, 92, 110, 115, 220, 230, 253, 460, 506, 1012, 1265, 2530, 5060.
What is 5060 in binary?
1001111000100 (hexadecimal 13C4, octal 11704).
What is the square root of 5060?
About 71.1337, exactly 2√1265.
Is 5060 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 5060?
5060 is a Harshad number: divisible by its digit sum 11.