The number 58141
58141 is a composite number with 4 divisors. Its prime factorisation is 53 × 1097. Divisors (4): 1, 53, 1097, 58141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 58141: a semiprime: 53 × 1097, the product of two primes.
- 2
58141 is composite. Its prime factorisation is
- 3
The divisors add up to 59292; without 58141 itself that is 1151, so 58141 is deficient (1151 is less than 58141). Euler's totient φ(58141) = 56992 numbers up to 58141 share no factor with it.
- 4
The digits of 58141 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 58141 = 53 \times 1097 \]
58141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 59292 |
| Euler totient φ(n) | 56992 |
| Square | 3380375881 |
| Cube | 196538434097221 |
| Square root | 241.124449 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.8141 × |
58141 in other forms
| Form | Value |
|---|---|
| In words | fifty-eight thousand one hundred and forty-one |
| Binary (base 2) | 1110001100011101 |
| Octal (base 8) | 161435 |
| Hexadecimal (base 16) | E31D |
| Base 3 | 2221202101 |
| As time | 58141 seconds = 16 h 9 min 1 s |
Is 58141 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 1) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 58141 a prime number?
No. 58141 = 53 × 1097, so it is divisible by 53.
What are the factors of 58141?
1, 53, 1097, 58141.
What is 58141 in binary?
1110001100011101 (hexadecimal E31D, octal 161435).
What is the square root of 58141?
About 241.1244.
Is 58141 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 58141?
58141 is a semiprime: 53 × 1097, the product of two primes.