The number 53362
53362 is a composite number with 4 divisors. Its prime factorisation is 2 × 26681. Divisors (4): 1, 2, 26681, 53362.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53362: a semiprime: 2 × 26681, the product of two primes.
- 2
53362 is composite. Its prime factorisation is
- 3
The divisors add up to 80046; without 53362 itself that is 26684, so 53362 is deficient (26684 is less than 53362). Euler's totient φ(53362) = 26680 numbers up to 53362 share no factor with it.
- 4
The digits of 53362 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 184 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53362 = 2 \times 26681 \]
53362 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 80046 |
| Euler totient φ(n) | 26680 |
| Square | 2847503044 |
| Cube | 151948457433928 |
| Square root | 231.002164 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 184 |
| Scientific notation | 5.3362 × |
53362 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand three hundred and sixty-two |
| Binary (base 2) | 1101000001110010 |
| Octal (base 8) | 150162 |
| Hexadecimal (base 16) | D072 |
| Base 3 | 2201012101 |
| As time | 53362 seconds = 14 h 49 min 22 s |
Is 53362 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53362 ÷ 2 = 26681) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 2) | 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 2) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53362 a prime number?
No. 53362 = 2 × 26681, so it is divisible by 2.
What are the factors of 53362?
1, 2, 26681, 53362.
What is 53362 in binary?
1101000001110010 (hexadecimal D072, octal 150162).
What is the square root of 53362?
About 231.0022.
Is 53362 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 53362?
53362 is a semiprime: 2 × 26681, the product of two primes.