The number 5159
5159 is a composite number with 8 divisors. Its prime factorisation is 7 × 11 × 67. Divisors (8): 1, 7, 11, 67, 77, 469, 737, 5159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5159 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5159 is composite. Its prime factorisation is
- 3
The divisors add up to 6528; without 5159 itself that is 1369, so 5159 is deficient (1369 is less than 5159). Euler's totient φ(5159) = 3960 numbers up to 5159 share no factor with it.
- 4
The digits of 5159 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 147 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5159 = 7 \times 11 \times 67 \]
5159 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 6528 |
| Euler totient φ(n) | 3960 |
| Square | 26615281 |
| Cube | 137308234679 |
| Square root | 71.826179 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 147 |
| Scientific notation | 5.159 × |
5159 in other forms
| Form | Value |
|---|---|
| In words | five thousand one hundred and fifty-nine |
| Binary (base 2) | 1010000100111 |
| Octal (base 8) | 12047 |
| Hexadecimal (base 16) | 1427 |
| Base 3 | 21002002 |
| As time | 5159 seconds = 1 h 25 min 59 s |
Is 5159 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (5159 ÷ 7 = 737) | 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 7) | 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 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (5159 ÷ 11 = 469) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5159 a prime number?
No. 5159 = 7 × 11 × 67, so it is divisible by 7.
What are the factors of 5159?
1, 7, 11, 67, 77, 469, 737, 5159.
What is 5159 in binary?
1010000100111 (hexadecimal 1427, octal 12047).
What is the square root of 5159?
About 71.8262.
Is 5159 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 5159?
It is a composite number with 8 divisors.