The number 52964
52964 is a composite number with 6 divisors. Its prime factorisation is × 13241. Divisors (6): 1, 2, 4, 13241, 26482, 52964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52964 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52964 is composite. Its prime factorisation is
- 3
The divisors add up to 92694; without 52964 itself that is 39730, so 52964 is deficient (39730 is less than 52964). Euler's totient φ(52964) = 26480 numbers up to 52964 share no factor with it.
- 4
The digits of 52964 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52964 = 2^{2} \times 13241 \]52964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 92694 |
| Euler totient φ(n) | 26480 |
| Square | 2805185296 |
| Cube | 148573834017344 |
| Square root | 230.139088 (= 2√13241) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.2964 × |
52964 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand nine hundred and sixty-four |
| Binary (base 2) | 1100111011100100 |
| Octal (base 8) | 147344 |
| Hexadecimal (base 16) | CEE4 |
| Base 3 | 2200122122 |
| As time | 52964 seconds = 14 h 42 min 44 s |
Is 52964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52964 ÷ 2 = 26482) | 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 | Yes (52964 ÷ 4 = 13241) | 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 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52964 a prime number?
No. 52964 = × 13241, so it is divisible by 2.
What are the factors of 52964?
1, 2, 4, 13241, 26482, 52964.
What is 52964 in binary?
1100111011100100 (hexadecimal CEE4, octal 147344).
What is the square root of 52964?
About 230.1391, exactly 2√13241.
Is 52964 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 52964?
It is a composite number with 6 divisors.