The number 53571
53571 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 2551. Divisors (8): 1, 3, 7, 21, 2551, 7653, 17857, 53571.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53571: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.
- 2
53571 is composite. Its prime factorisation is
- 3
The divisors add up to 81664; without 53571 itself that is 28093, so 53571 is deficient (28093 is less than 53571). Euler's totient φ(53571) = 30600 numbers up to 53571 share no factor with it.
- 4
The digits of 53571 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 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53571 = 3 \times 7 \times 2551 \]
53571 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 81664 |
| Euler totient φ(n) | 30600 |
| Square | 2869852041 |
| Cube | 153740843688411 |
| Square root | 231.454099 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.3571 × |
53571 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand five hundred and seventy-one |
| Binary (base 2) | 1101000101000011 |
| Octal (base 8) | 150503 |
| Hexadecimal (base 16) | D143 |
| Base 3 | 2201111010 |
| As time | 53571 seconds = 14 h 52 min 51 s |
Is 53571 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 (53571 ÷ 3 = 17857) | 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 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 (53571 ÷ 7 = 7653) | 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 3) | 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 1) | 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 53571 a prime number?
No. 53571 = 3 × 7 × 2551, so it is divisible by 3.
What are the factors of 53571?
1, 3, 7, 21, 2551, 7653, 17857, 53571.
What is 53571 in binary?
1101000101000011 (hexadecimal D143, octal 150503).
What is the square root of 53571?
About 231.4541.
Is 53571 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 53571?
53571 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.