The number 53371
53371 is a composite number with 6 divisors. Its prime factorisation is 19 Ć . Divisors (6): 1, 19, 53, 1007, 2809, 53371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53371: a Harshad number: divisible by its digit sum 19.
- 2
53371 is composite. Its prime factorisation is
- 3
The divisors add up to 57260; without 53371 itself that is 3889, so 53371 is deficient (3889 is less than 53371). Euler's totient Ļ(53371) = 49608 numbers up to 53371 share no factor with it.
- 4
The digits of 53371 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53371 = 19 \times 53^{2} \]53371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 57260 |
| Euler totient Ļ(n) | 49608 |
| Square | 2848463641 |
| Cube | 152025352983811 |
| Square root | 231.021644 (= 53ā19) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.3371 Ć |
53371 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand three hundred and seventy-one |
| Binary (base 2) | 1101000001111011 |
| Octal (base 8) | 150173 |
| Hexadecimal (base 16) | D07B |
| Base 3 | 2201012201 |
| As time | 53371 seconds = 14 h 49 min 31 s |
Is 53371 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 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 1) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53371 a prime number?
No. 53371 = 19 Ć , so it is divisible by 19.
What are the factors of 53371?
1, 19, 53, 1007, 2809, 53371.
What is 53371 in binary?
1101000001111011 (hexadecimal D07B, octal 150173).
What is the square root of 53371?
About 231.0216, exactly 53ā19.
Is 53371 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 53371?
53371 is a Harshad number: divisible by its digit sum 19.