The number 53391
53391 is a composite number with 12 divisors. Its prime factorisation is 3 × 13 × . Divisors (12): 1, 3, 13, 37, 39, 111, 481, 1369, 1443, 4107, 17797, 53391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53391 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53391 is composite. Its prime factorisation is
- 3
The divisors add up to 78792; without 53391 itself that is 25401, so 53391 is deficient (25401 is less than 53391). Euler's totient φ(53391) = 31968 numbers up to 53391 share no factor with it.
- 4
The digits of 53391 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 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53391 = 3 \times 13 \times 37^{2} \]53391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 78792 |
| Euler totient φ(n) | 31968 |
| Square | 2850598881 |
| Cube | 152196324855471 |
| Square root | 231.064926 (= 37√39) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.3391 × |
53391 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand three hundred and ninety-one |
| Binary (base 2) | 1101000010001111 |
| Octal (base 8) | 150217 |
| Hexadecimal (base 16) | D08F |
| Base 3 | 2201020110 |
| As time | 53391 seconds = 14 h 49 min 51 s |
Is 53391 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 (53391 ÷ 3 = 17797) | 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 | 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 7) | 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 8) | 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 53391 a prime number?
No. 53391 = 3 × 13 × , so it is divisible by 3.
What are the factors of 53391?
1, 3, 13, 37, 39, 111, 481, 1369, 1443, 4107, 17797, 53391.
What is 53391 in binary?
1101000010001111 (hexadecimal D08F, octal 150217).
What is the square root of 53391?
About 231.0649, exactly 37√39.
Is 53391 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 53391?
It is a composite number with 12 divisors.