The number 53406
53406 is a composite number with 32 divisors. Its prime factorisation is 2 × × 23 × 43. Divisors (32): 1, 2, 3, 6, 9, 18, 23, 27, 43, 46, 54, 69, 86, 129, 138, 207 … 53406.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53406: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
53406 is composite. Its prime factorisation is
- 3
The divisors add up to 126720; without 53406 itself that is 73314, so 53406 is abundant (73314 is more than 53406). Euler's totient φ(53406) = 16632 numbers up to 53406 share no factor with it.
- 4
The digits of 53406 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 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53406 = 2 \times 3^{3} \times 23 \times 43 \]53406 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 126720 |
| Euler totient φ(n) | 16632 |
| Square | 2852200836 |
| Cube | 152324637847416 |
| Square root | 231.097382 (= 3√5934) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 70 |
| Scientific notation | 5.3406 × |
53406 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand four hundred and six |
| Binary (base 2) | 1101000010011110 |
| Octal (base 8) | 150236 |
| Hexadecimal (base 16) | D09E |
| Base 3 | 2201021000 |
| As time | 53406 seconds = 14 h 50 min 6 s |
Is 53406 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53406 ÷ 2 = 26703) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (53406 ÷ 3 = 17802) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (53406 ÷ 6 = 8901) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (53406 ÷ 9 = 5934) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53406 a prime number?
No. 53406 = 2 × × 23 × 43, so it is divisible by 2.
What are the factors of 53406?
1, 2, 3, 6, 9, 18, 23, 27, 43, 46, 54, 69, 86, 129, 138, 207, 258, 387, 414, 621, 774, 989, 1161, 1242, 1978, 2322, 2967, 5934, 8901, 17802, 26703, 53406.
What is 53406 in binary?
1101000010011110 (hexadecimal D09E, octal 150236).
What is the square root of 53406?
About 231.0974, exactly 3√5934.
Is 53406 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 53406?
53406 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.