The number 53408
53408 is a composite number with 12 divisors. Its prime factorisation is × 1669. Divisors (12): 1, 2, 4, 8, 16, 32, 1669, 3338, 6676, 13352, 26704, 53408.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53408 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53408 is composite. Its prime factorisation is
- 3
The divisors add up to 105210; without 53408 itself that is 51802, so 53408 is deficient (51802 is less than 53408). Euler's totient φ(53408) = 26688 numbers up to 53408 share no factor with it.
- 4
The digits of 53408 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53408 = 2^{5} \times 1669 \]53408 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 105210 |
| Euler totient φ(n) | 26688 |
| Square | 2852414464 |
| Cube | 152341751693312 |
| Square root | 231.101709 (= 4√3338) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.3408 × |
53408 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand four hundred and eight |
| Binary (base 2) | 1101000010100000 |
| Octal (base 8) | 150240 |
| Hexadecimal (base 16) | D0A0 |
| Base 3 | 2201021002 |
| As time | 53408 seconds = 14 h 50 min 8 s |
Is 53408 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53408 ÷ 2 = 26704) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (53408 ÷ 4 = 13352) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 | Yes (53408 ÷ 8 = 6676) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53408 a prime number?
No. 53408 = × 1669, so it is divisible by 2.
What are the factors of 53408?
1, 2, 4, 8, 16, 32, 1669, 3338, 6676, 13352, 26704, 53408.
What is 53408 in binary?
1101000010100000 (hexadecimal D0A0, octal 150240).
What is the square root of 53408?
About 231.1017, exactly 4√3338.
Is 53408 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 53408?
It is a composite number with 12 divisors.