The number 2959
2959 is a composite number with 4 divisors. Its prime factorisation is 11 × 269. Divisors (4): 1, 11, 269, 2959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 2959: a semiprime: 11 × 269, the product of two primes.
- 2
2959 is composite. Its prime factorisation is
- 3
The divisors add up to 3240; without 2959 itself that is 281, so 2959 is deficient (281 is less than 2959). Euler's totient φ(2959) = 2680 numbers up to 2959 share no factor with it.
- 4
The digits of 2959 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 2959 = 11 \times 269 \]
2959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 3240 |
| Euler totient φ(n) | 2680 |
| Square | 8755681 |
| Cube | 25908060079 |
| Square root | 54.396691 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 97 |
| Scientific notation | 2.959 × |
2959 in other forms
| Form | Value |
|---|---|
| In words | two thousand nine hundred and fifty-nine |
| Roman numerals | MMCMLIX |
| Binary (base 2) | 101110001111 |
| Octal (base 8) | 5617 |
| Hexadecimal (base 16) | B8F |
| Base 3 | 11001121 |
| As time | 2959 seconds = 49 min 19 s |
Is 2959 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 (2959 ÷ 11 = 269) | 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 2959 a prime number?
No. 2959 = 11 × 269, so it is divisible by 11.
What are the factors of 2959?
1, 11, 269, 2959.
What is 2959 in binary?
101110001111 (hexadecimal B8F, octal 5617).
What is the square root of 2959?
About 54.3967.
What is 2959 in Roman numerals?
MMCMLIX.
Is 2959 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 2959?
2959 is a semiprime: 11 × 269, the product of two primes.