The number 60391
60391 is a composite number with 4 divisors. Its prime factorisation is 131 × 461. Divisors (4): 1, 131, 461, 60391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 60391: a semiprime: 131 × 461, the product of two primes.
- 2
60391 is composite. Its prime factorisation is
- 3
The divisors add up to 60984; without 60391 itself that is 593, so 60391 is deficient (593 is less than 60391). Euler's totient φ(60391) = 59800 numbers up to 60391 share no factor with it.
- 4
The digits of 60391 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 210 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60391 = 131 \times 461 \]
60391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60984 |
| Euler totient φ(n) | 59800 |
| Square | 3647072881 |
| Cube | 220250378356471 |
| Square root | 245.745804 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 210 |
| Scientific notation | 6.0391 × |
60391 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand three hundred and ninety-one |
| Binary (base 2) | 1110101111100111 |
| Octal (base 8) | 165747 |
| Hexadecimal (base 16) | EBE7 |
| Base 3 | 10001211201 |
| As time | 60391 seconds = 16 h 46 min 31 s |
Is 60391 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 7) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60391 a prime number?
No. 60391 = 131 × 461, so it is divisible by 131.
What are the factors of 60391?
1, 131, 461, 60391.
What is 60391 in binary?
1110101111100111 (hexadecimal EBE7, octal 165747).
What is the square root of 60391?
About 245.7458.
Is 60391 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 60391?
60391 is a semiprime: 131 × 461, the product of two primes.