The number 60141
60141 is a composite number with 4 divisors. Its prime factorisation is 3 × 20047. Divisors (4): 1, 3, 20047, 60141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 60141: a semiprime: 3 × 20047, the product of two primes.
- 2
60141 is composite. Its prime factorisation is
- 3
The divisors add up to 80192; without 60141 itself that is 20051, so 60141 is deficient (20051 is less than 60141). Euler's totient φ(60141) = 40092 numbers up to 60141 share no factor with it.
- 4
The digits of 60141 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60141 = 3 \times 20047 \]
60141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 80192 |
| Euler totient φ(n) | 40092 |
| Square | 3616939881 |
| Cube | 217526381383221 |
| Square root | 245.236620 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 6.0141 × |
60141 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand one hundred and forty-one |
| Binary (base 2) | 1110101011101101 |
| Octal (base 8) | 165355 |
| Hexadecimal (base 16) | EAED |
| Base 3 | 10001111110 |
| As time | 60141 seconds = 16 h 42 min 21 s |
Is 60141 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 (60141 ÷ 3 = 20047) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60141 a prime number?
No. 60141 = 3 × 20047, so it is divisible by 3.
What are the factors of 60141?
1, 3, 20047, 60141.
What is 60141 in binary?
1110101011101101 (hexadecimal EAED, octal 165355).
What is the square root of 60141?
About 245.2366.
Is 60141 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 60141?
60141 is a semiprime: 3 × 20047, the product of two primes.