The number 53141
53141 is a composite number with 4 divisors. Its prime factorisation is 11 × 4831. Divisors (4): 1, 11, 4831, 53141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53141: a semiprime: 11 × 4831, the product of two primes.
- 2
53141 is composite. Its prime factorisation is
- 3
The divisors add up to 57984; without 53141 itself that is 4843, so 53141 is deficient (4843 is less than 53141). Euler's totient φ(53141) = 48300 numbers up to 53141 share no factor with it.
- 4
The digits of 53141 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53141 = 11 \times 4831 \]
53141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 57984 |
| Euler totient φ(n) | 48300 |
| Square | 2823965881 |
| Cube | 150068370882221 |
| Square root | 230.523318 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.3141 × |
53141 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand one hundred and forty-one |
| Binary (base 2) | 1100111110010101 |
| Octal (base 8) | 147625 |
| Hexadecimal (base 16) | CF95 |
| Base 3 | 2200220012 |
| As time | 53141 seconds = 14 h 45 min 41 s |
Is 53141 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 1) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 | Yes (53141 ÷ 11 = 4831) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53141 a prime number?
No. 53141 = 11 × 4831, so it is divisible by 11.
What are the factors of 53141?
1, 11, 4831, 53141.
What is 53141 in binary?
1100111110010101 (hexadecimal CF95, octal 147625).
What is the square root of 53141?
About 230.5233.
Is 53141 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 53141?
53141 is a semiprime: 11 × 4831, the product of two primes.