The number 52701
52701 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 1597. Divisors (8): 1, 3, 11, 33, 1597, 4791, 17567, 52701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52701: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
52701 is composite. Its prime factorisation is
- 3
The divisors add up to 76704; without 52701 itself that is 24003, so 52701 is deficient (24003 is less than 52701). Euler's totient φ(52701) = 31920 numbers up to 52701 share no factor with it.
- 4
The digits of 52701 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52701 = 3 \times 11 \times 1597 \]
52701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 76704 |
| Euler totient φ(n) | 31920 |
| Square | 2777395401 |
| Cube | 146371515028101 |
| Square root | 229.566984 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.2701 × |
52701 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand seven hundred and one |
| Binary (base 2) | 1100110111011101 |
| Octal (base 8) | 146735 |
| Hexadecimal (base 16) | CDDD |
| Base 3 | 2200021220 |
| As time | 52701 seconds = 14 h 38 min 21 s |
Is 52701 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 (52701 ÷ 3 = 17567) | 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 | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 | Yes (52701 ÷ 11 = 4791) | 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 52701 a prime number?
No. 52701 = 3 × 11 × 1597, so it is divisible by 3.
What are the factors of 52701?
1, 3, 11, 33, 1597, 4791, 17567, 52701.
What is 52701 in binary?
1100110111011101 (hexadecimal CDDD, octal 146735).
What is the square root of 52701?
About 229.5670.
Is 52701 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 52701?
52701 is a happy number: repeatedly adding the squares of its digits reaches 1.