The number 52941
52941 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 2521. Divisors (8): 1, 3, 7, 21, 2521, 7563, 17647, 52941.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52941: a Harshad number: divisible by its digit sum 21.
- 2
52941 is composite. Its prime factorisation is
- 3
The divisors add up to 80704; without 52941 itself that is 27763, so 52941 is deficient (27763 is less than 52941). Euler's totient φ(52941) = 30240 numbers up to 52941 share no factor with it.
- 4
The digits of 52941 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52941 = 3 \times 7 \times 2521 \]
52941 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 80704 |
| Euler totient φ(n) | 30240 |
| Square | 2802749481 |
| Cube | 148380360273621 |
| Square root | 230.089113 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.2941 × |
52941 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand nine hundred and forty-one |
| Binary (base 2) | 1100111011001101 |
| Octal (base 8) | 147315 |
| Hexadecimal (base 16) | CECD |
| Base 3 | 2200121210 |
| As time | 52941 seconds = 14 h 42 min 21 s |
Is 52941 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 (52941 ÷ 3 = 17647) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 | Yes (52941 ÷ 7 = 7563) | 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 5) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52941 a prime number?
No. 52941 = 3 × 7 × 2521, so it is divisible by 3.
What are the factors of 52941?
1, 3, 7, 21, 2521, 7563, 17647, 52941.
What is 52941 in binary?
1100111011001101 (hexadecimal CECD, octal 147315).
What is the square root of 52941?
About 230.0891.
Is 52941 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 52941?
52941 is a Harshad number: divisible by its digit sum 21.