The number 52959
52959 is a composite number with 8 divisors. Its prime factorisation is 3 × 127 × 139. Divisors (8): 1, 3, 127, 139, 381, 417, 17653, 52959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52959 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52959 is composite. Its prime factorisation is
- 3
The divisors add up to 71680; without 52959 itself that is 18721, so 52959 is deficient (18721 is less than 52959). Euler's totient φ(52959) = 34776 numbers up to 52959 share no factor with it.
- 4
The digits of 52959 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52959 = 3 \times 127 \times 139 \]
52959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 71680 |
| Euler totient φ(n) | 34776 |
| Square | 2804655681 |
| Cube | 148531760210079 |
| Square root | 230.128225 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.2959 × |
52959 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand nine hundred and fifty-nine |
| Binary (base 2) | 1100111011011111 |
| Octal (base 8) | 147337 |
| Hexadecimal (base 16) | CEDF |
| Base 3 | 2200122110 |
| As time | 52959 seconds = 14 h 42 min 39 s |
Is 52959 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 (52959 ÷ 3 = 17653) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52959 a prime number?
No. 52959 = 3 × 127 × 139, so it is divisible by 3.
What are the factors of 52959?
1, 3, 127, 139, 381, 417, 17653, 52959.
What is 52959 in binary?
1100111011011111 (hexadecimal CEDF, octal 147337).
What is the square root of 52959?
About 230.1282.
Is 52959 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 52959?
It is a composite number with 8 divisors.