The number 5059
5059 is the 677th prime number. Its only divisors are 1 and 5059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5059: the 677th prime number.
- 2
5059 is prime, so its only factors are 1 and 5059. It is the 677th prime; the next prime is 5077 and the one before is 5051.
- 3
The divisors add up to 5060; without 5059 itself that is 1, so 5059 is deficient (1 is less than 5059). Euler's totient φ(5059) = 5058 numbers up to 5059 share no factor with it.
- 4
The digits of 5059 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 72 steps to reach 1.
5059 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 5060 |
| Euler totient φ(n) | 5058 |
| Square | 25593481 |
| Cube | 129477420379 |
| Square root | 71.126648 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 72 |
| Scientific notation | 5.059 × |
5059 in other forms
| Form | Value |
|---|---|
| In words | five thousand and fifty-nine |
| Binary (base 2) | 1001111000011 |
| Octal (base 8) | 11703 |
| Hexadecimal (base 16) | 13C3 |
| Base 3 | 20221101 |
| As time | 5059 seconds = 1 h 24 min 19 s |
Is 5059 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 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5059 a prime number?
Yes. 5059 is divisible only by 1 and itself.
What are the factors of 5059?
1, 5059.
What is 5059 in binary?
1001111000011 (hexadecimal 13C3, octal 11703).
What is the square root of 5059?
About 71.1266.
Is 5059 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 5059?
5059 is the 677th prime number.