The number 60131
60131 is a composite number with 4 divisors. Its prime factorisation is 157 × 383. Divisors (4): 1, 157, 383, 60131.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 60131: a semiprime: 157 × 383, the product of two primes.
- 2
60131 is composite. Its prime factorisation is
- 3
The divisors add up to 60672; without 60131 itself that is 541, so 60131 is deficient (541 is less than 60131). Euler's totient φ(60131) = 59592 numbers up to 60131 share no factor with it.
- 4
The digits of 60131 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60131 = 157 \times 383 \]
60131 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60672 |
| Euler totient φ(n) | 59592 |
| Square | 3615737161 |
| Cube | 217417891228091 |
| Square root | 245.216231 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 91 |
| Scientific notation | 6.0131 × |
60131 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand one hundred and thirty-one |
| Binary (base 2) | 1110101011100011 |
| Octal (base 8) | 165343 |
| Hexadecimal (base 16) | EAE3 |
| Base 3 | 10001111002 |
| As time | 60131 seconds = 16 h 42 min 11 s |
Is 60131 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 1) | 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 5) | 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 60131 a prime number?
No. 60131 = 157 × 383, so it is divisible by 157.
What are the factors of 60131?
1, 157, 383, 60131.
What is 60131 in binary?
1110101011100011 (hexadecimal EAE3, octal 165343).
What is the square root of 60131?
About 245.2162.
Is 60131 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 60131?
60131 is a semiprime: 157 × 383, the product of two primes.