The number 5959
5959 is a composite number with 4 divisors. Its prime factorisation is 59 × 101. Divisors (4): 1, 59, 101, 5959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5959: a semiprime: 59 × 101, the product of two primes.
- 2
5959 is composite. Its prime factorisation is
- 3
The divisors add up to 6120; without 5959 itself that is 161, so 5959 is deficient (161 is less than 5959). Euler's totient φ(5959) = 5800 numbers up to 5959 share no factor with it.
- 4
The digits of 5959 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 124 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5959 = 59 \times 101 \]
5959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6120 |
| Euler totient φ(n) | 5800 |
| Square | 35509681 |
| Cube | 211602189079 |
| Square root | 77.194559 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 124 |
| Scientific notation | 5.959 × |
5959 in other forms
| Form | Value |
|---|---|
| In words | five thousand nine hundred and fifty-nine |
| Binary (base 2) | 1011101000111 |
| Octal (base 8) | 13507 |
| Hexadecimal (base 16) | 1747 |
| Base 3 | 22011201 |
| As time | 5959 seconds = 1 h 39 min 19 s |
Is 5959 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 2) | 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 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 8) | 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 5959 a prime number?
No. 5959 = 59 × 101, so it is divisible by 59.
What are the factors of 5959?
1, 59, 101, 5959.
What is 5959 in binary?
1011101000111 (hexadecimal 1747, octal 13507).
What is the square root of 5959?
About 77.1946.
Is 5959 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 5959?
5959 is a semiprime: 59 × 101, the product of two primes.