The number 53638
53638 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 2063. Divisors (8): 1, 2, 13, 26, 2063, 4126, 26819, 53638.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53638 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53638 is composite. Its prime factorisation is
- 3
The divisors add up to 86688; without 53638 itself that is 33050, so 53638 is deficient (33050 is less than 53638). Euler's totient φ(53638) = 24744 numbers up to 53638 share no factor with it.
- 4
The digits of 53638 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53638 = 2 \times 13 \times 2063 \]
53638 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 86688 |
| Euler totient φ(n) | 24744 |
| Square | 2877035044 |
| Cube | 154318405690072 |
| Square root | 231.598791 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.3638 × |
53638 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand six hundred and thirty-eight |
| Binary (base 2) | 1101000110000110 |
| Octal (base 8) | 150606 |
| Hexadecimal (base 16) | D186 |
| Base 3 | 2201120121 |
| As time | 53638 seconds = 14 h 53 min 58 s |
Is 53638 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53638 ÷ 2 = 26819) | 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 3) | 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 4) | 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 | No (remainder 7) | 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 2) | 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 53638 a prime number?
No. 53638 = 2 × 13 × 2063, so it is divisible by 2.
What are the factors of 53638?
1, 2, 13, 26, 2063, 4126, 26819, 53638.
What is 53638 in binary?
1101000110000110 (hexadecimal D186, octal 150606).
What is the square root of 53638?
About 231.5988.
Is 53638 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 53638?
It is a composite number with 8 divisors.