The number 60313
60313 is a composite number with 4 divisors. Its prime factorisation is 11 × 5483. Divisors (4): 1, 11, 5483, 60313.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 60313: a semiprime: 11 × 5483, the product of two primes.
- 2
60313 is composite. Its prime factorisation is
- 3
The divisors add up to 65808; without 60313 itself that is 5495, so 60313 is deficient (5495 is less than 60313). Euler's totient φ(60313) = 54820 numbers up to 60313 share no factor with it.
- 4
The digits of 60313 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 117 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60313 = 11 \times 5483 \]
60313 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 65808 |
| Euler totient φ(n) | 54820 |
| Square | 3637657969 |
| Cube | 219398065084297 |
| Square root | 245.587052 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 117 |
| Scientific notation | 6.0313 × |
60313 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand three hundred and thirteen |
| Binary (base 2) | 1110101110011001 |
| Octal (base 8) | 165631 |
| Hexadecimal (base 16) | EB99 |
| Base 3 | 10001201211 |
| As time | 60313 seconds = 16 h 45 min 13 s |
Is 60313 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 3) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (60313 ÷ 11 = 5483) | 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 60313 a prime number?
No. 60313 = 11 × 5483, so it is divisible by 11.
What are the factors of 60313?
1, 11, 5483, 60313.
What is 60313 in binary?
1110101110011001 (hexadecimal EB99, octal 165631).
What is the square root of 60313?
About 245.5871.
Is 60313 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 60313?
60313 is a semiprime: 11 × 5483, the product of two primes.