The number 52978
52978 is a composite number with 4 divisors. Its prime factorisation is 2 × 26489. Divisors (4): 1, 2, 26489, 52978.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52978: a semiprime: 2 × 26489, the product of two primes.
- 2
52978 is composite. Its prime factorisation is
- 3
The divisors add up to 79470; without 52978 itself that is 26492, so 52978 is deficient (26492 is less than 52978). Euler's totient φ(52978) = 26488 numbers up to 52978 share no factor with it.
- 4
The digits of 52978 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52978 = 2 \times 26489 \]
52978 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 79470 |
| Euler totient φ(n) | 26488 |
| Square | 2806668484 |
| Cube | 148691682945352 |
| Square root | 230.169503 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.2978 × |
52978 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand nine hundred and seventy-eight |
| Binary (base 2) | 1100111011110010 |
| Octal (base 8) | 147362 |
| Hexadecimal (base 16) | CEF2 |
| Base 3 | 2200200011 |
| As time | 52978 seconds = 14 h 42 min 58 s |
Is 52978 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52978 ÷ 2 = 26489) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52978 a prime number?
No. 52978 = 2 × 26489, so it is divisible by 2.
What are the factors of 52978?
1, 2, 26489, 52978.
What is 52978 in binary?
1100111011110010 (hexadecimal CEF2, octal 147362).
What is the square root of 52978?
About 230.1695.
Is 52978 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 52978?
52978 is a semiprime: 2 × 26489, the product of two primes.