The number 60931
60931 is a composite number with 8 divisors. Its prime factorisation is 13 × 43 × 109. Divisors (8): 1, 13, 43, 109, 559, 1417, 4687, 60931.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
60931 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
60931 is composite. Its prime factorisation is
- 3
The divisors add up to 67760; without 60931 itself that is 6829, so 60931 is deficient (6829 is less than 60931). Euler's totient φ(60931) = 54432 numbers up to 60931 share no factor with it.
- 4
The digits of 60931 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 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60931 = 13 \times 43 \times 109 \]
60931 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 67760 |
| Euler totient φ(n) | 54432 |
| Square | 3712586761 |
| Cube | 226211623934491 |
| Square root | 246.842055 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 34 |
| Scientific notation | 6.0931 × |
60931 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand nine hundred and thirty-one |
| Binary (base 2) | 1110111000000011 |
| Octal (base 8) | 167003 |
| Hexadecimal (base 16) | EE03 |
| Base 3 | 10002120201 |
| As time | 60931 seconds = 16 h 55 min 31 s |
Is 60931 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 3) | 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 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 2) | 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 60931 a prime number?
No. 60931 = 13 × 43 × 109, so it is divisible by 13.
What are the factors of 60931?
1, 13, 43, 109, 559, 1417, 4687, 60931.
What is 60931 in binary?
1110111000000011 (hexadecimal EE03, octal 167003).
What is the square root of 60931?
About 246.8421.
Is 60931 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 60931?
It is a composite number with 8 divisors.