The number 5061
5061 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 241. Divisors (8): 1, 3, 7, 21, 241, 723, 1687, 5061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5061 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5061 is composite. Its prime factorisation is
- 3
The divisors add up to 7744; without 5061 itself that is 2683, so 5061 is deficient (2683 is less than 5061). Euler's totient φ(5061) = 2880 numbers up to 5061 share no factor with it.
- 4
The digits of 5061 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5061 = 3 \times 7 \times 241 \]
5061 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 7744 |
| Euler totient φ(n) | 2880 |
| Square | 25613721 |
| Cube | 129631041981 |
| Square root | 71.140706 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 41 |
| Scientific notation | 5.061 × |
5061 in other forms
| Form | Value |
|---|---|
| In words | five thousand and sixty-one |
| Binary (base 2) | 1001111000101 |
| Octal (base 8) | 11705 |
| Hexadecimal (base 16) | 13C5 |
| Base 3 | 20221110 |
| As time | 5061 seconds = 1 h 24 min 21 s |
Is 5061 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 (5061 ÷ 3 = 1687) | 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 1) | 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 | Yes (5061 ÷ 7 = 723) | 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 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 5061 a prime number?
No. 5061 = 3 × 7 × 241, so it is divisible by 3.
What are the factors of 5061?
1, 3, 7, 21, 241, 723, 1687, 5061.
What is 5061 in binary?
1001111000101 (hexadecimal 13C5, octal 11705).
What is the square root of 5061?
About 71.1407.
Is 5061 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 5061?
It is a composite number with 8 divisors.