The number 53451
53451 is a composite number with 6 divisors. Its prime factorisation is × 5939. Divisors (6): 1, 3, 9, 5939, 17817, 53451.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53451 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53451 is composite. Its prime factorisation is
- 3
The divisors add up to 77220; without 53451 itself that is 23769, so 53451 is deficient (23769 is less than 53451). Euler's totient φ(53451) = 35628 numbers up to 53451 share no factor with it.
- 4
The digits of 53451 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53451 = 3^{2} \times 5939 \]53451 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 77220 |
| Euler totient φ(n) | 35628 |
| Square | 2857009401 |
| Cube | 152710009492851 |
| Square root | 231.194723 (= 3√5939) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.3451 × |
53451 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand four hundred and fifty-one |
| Binary (base 2) | 1101000011001011 |
| Octal (base 8) | 150313 |
| Hexadecimal (base 16) | D0CB |
| Base 3 | 2201022200 |
| As time | 53451 seconds = 14 h 50 min 51 s |
Is 53451 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 (53451 ÷ 3 = 17817) | 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 6) | 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 | Yes (53451 ÷ 9 = 5939) | 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 2) | 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 53451 a prime number?
No. 53451 = × 5939, so it is divisible by 3.
What are the factors of 53451?
1, 3, 9, 5939, 17817, 53451.
What is 53451 in binary?
1101000011001011 (hexadecimal D0CB, octal 150313).
What is the square root of 53451?
About 231.1947, exactly 3√5939.
Is 53451 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 53451?
It is a composite number with 6 divisors.