The number 53631
53631 is a composite number with 12 divisors. Its prime factorisation is × 59 × 101. Divisors (12): 1, 3, 9, 59, 101, 177, 303, 531, 909, 5959, 17877, 53631.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53631 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53631 is composite. Its prime factorisation is
- 3
The divisors add up to 79560; without 53631 itself that is 25929, so 53631 is deficient (25929 is less than 53631). Euler's totient φ(53631) = 34800 numbers up to 53631 share no factor with it.
- 4
The digits of 53631 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
\[ 53631 = 3^{2} \times 59 \times 101 \]53631 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 79560 |
| Euler totient φ(n) | 34800 |
| Square | 2876284161 |
| Cube | 154257995838591 |
| Square root | 231.583678 (= 3√5959) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.3631 × |
53631 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand six hundred and thirty-one |
| Binary (base 2) | 1101000101111111 |
| Octal (base 8) | 150577 |
| Hexadecimal (base 16) | D17F |
| Base 3 | 2201120100 |
| As time | 53631 seconds = 14 h 53 min 51 s |
Is 53631 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 (53631 ÷ 3 = 17877) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (53631 ÷ 9 = 5959) | 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 6) | 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 53631 a prime number?
No. 53631 = × 59 × 101, so it is divisible by 3.
What are the factors of 53631?
1, 3, 9, 59, 101, 177, 303, 531, 909, 5959, 17877, 53631.
What is 53631 in binary?
1101000101111111 (hexadecimal D17F, octal 150577).
What is the square root of 53631?
About 231.5837, exactly 3√5959.
Is 53631 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 53631?
It is a composite number with 12 divisors.