The number 60051
60051 is a composite number with 8 divisors. Its prime factorisation is 3 × 37 × 541. Divisors (8): 1, 3, 37, 111, 541, 1623, 20017, 60051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
60051 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
60051 is composite. Its prime factorisation is
- 3
The divisors add up to 82384; without 60051 itself that is 22333, so 60051 is deficient (22333 is less than 60051). Euler's totient φ(60051) = 38880 numbers up to 60051 share no factor with it.
- 4
The digits of 60051 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60051 = 3 \times 37 \times 541 \]
60051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 82384 |
| Euler totient φ(n) | 38880 |
| Square | 3606122601 |
| Cube | 216551268312651 |
| Square root | 245.053055 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 6.0051 × |
60051 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand and fifty-one |
| Binary (base 2) | 1110101010010011 |
| Octal (base 8) | 165223 |
| Hexadecimal (base 16) | EA93 |
| Base 3 | 10001101010 |
| As time | 60051 seconds = 16 h 40 min 51 s |
Is 60051 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 (60051 ÷ 3 = 20017) | 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 5) | 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 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60051 a prime number?
No. 60051 = 3 × 37 × 541, so it is divisible by 3.
What are the factors of 60051?
1, 3, 37, 111, 541, 1623, 20017, 60051.
What is 60051 in binary?
1110101010010011 (hexadecimal EA93, octal 165223).
What is the square root of 60051?
About 245.0531.
Is 60051 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 60051?
It is a composite number with 8 divisors.