The number 60351
60351 is a composite number with 4 divisors. Its prime factorisation is 3 × 20117. Divisors (4): 1, 3, 20117, 60351.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 60351: a semiprime: 3 × 20117, the product of two primes.
- 2
60351 is composite. Its prime factorisation is
- 3
The divisors add up to 80472; without 60351 itself that is 20121, so 60351 is deficient (20121 is less than 60351). Euler's totient φ(60351) = 40232 numbers up to 60351 share no factor with it.
- 4
The digits of 60351 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 241 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60351 = 3 \times 20117 \]
60351 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 80472 |
| Euler totient φ(n) | 40232 |
| Square | 3642243201 |
| Cube | 219813019423551 |
| Square root | 245.664405 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 241 |
| Scientific notation | 6.0351 × |
60351 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand three hundred and fifty-one |
| Binary (base 2) | 1110101110111111 |
| Octal (base 8) | 165677 |
| Hexadecimal (base 16) | EBBF |
| Base 3 | 10001210020 |
| As time | 60351 seconds = 16 h 45 min 51 s |
Is 60351 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 | Yes (60351 ÷ 3 = 20117) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60351 a prime number?
No. 60351 = 3 × 20117, so it is divisible by 3.
What are the factors of 60351?
1, 3, 20117, 60351.
What is 60351 in binary?
1110101110111111 (hexadecimal EBBF, octal 165677).
What is the square root of 60351?
About 245.6644.
Is 60351 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 60351?
60351 is a semiprime: 3 × 20117, the product of two primes.