The number 53651
53651 is a composite number with 4 divisors. Its prime factorisation is 13 × 4127. Divisors (4): 1, 13, 4127, 53651.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53651: a semiprime: 13 × 4127, the product of two primes.
- 2
53651 is composite. Its prime factorisation is
- 3
The divisors add up to 57792; without 53651 itself that is 4141, so 53651 is deficient (4141 is less than 53651). Euler's totient φ(53651) = 49512 numbers up to 53651 share no factor with it.
- 4
The digits of 53651 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
\[ 53651 = 13 \times 4127 \]
53651 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 57792 |
| Euler totient φ(n) | 49512 |
| Square | 2878429801 |
| Cube | 154430637253451 |
| Square root | 231.626855 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.3651 × |
53651 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand six hundred and fifty-one |
| Binary (base 2) | 1101000110010011 |
| Octal (base 8) | 150623 |
| Hexadecimal (base 16) | D193 |
| Base 3 | 2201121002 |
| As time | 53651 seconds = 14 h 54 min 11 s |
Is 53651 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 | No (remainder 2) | 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 5) | 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53651 a prime number?
No. 53651 = 13 × 4127, so it is divisible by 13.
What are the factors of 53651?
1, 13, 4127, 53651.
What is 53651 in binary?
1101000110010011 (hexadecimal D193, octal 150623).
What is the square root of 53651?
About 231.6269.
Is 53651 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 53651?
53651 is a semiprime: 13 × 4127, the product of two primes.