The number 60146
60146 is a composite number with 16 divisors. Its prime factorisation is 2 × 17 × 29 × 61. Divisors (16): 1, 2, 17, 29, 34, 58, 61, 122, 493, 986, 1037, 1769, 2074, 3538, 30073, 60146.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 60146: a Harshad number: divisible by its digit sum 17.
- 2
60146 is composite. Its prime factorisation is
- 3
The divisors add up to 100440; without 60146 itself that is 40294, so 60146 is deficient (40294 is less than 60146). Euler's totient φ(60146) = 26880 numbers up to 60146 share no factor with it.
- 4
The digits of 60146 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60146 = 2 \times 17 \times 29 \times 61 \]
60146 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 100440 |
| Euler totient φ(n) | 26880 |
| Square | 3617541316 |
| Cube | 217580639992136 |
| Square root | 245.246814 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 73 |
| Scientific notation | 6.0146 × |
60146 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand one hundred and forty-six |
| Binary (base 2) | 1110101011110010 |
| Octal (base 8) | 165362 |
| Hexadecimal (base 16) | EAF2 |
| Base 3 | 10001111122 |
| As time | 60146 seconds = 16 h 42 min 26 s |
Is 60146 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (60146 ÷ 2 = 30073) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60146 a prime number?
No. 60146 = 2 × 17 × 29 × 61, so it is divisible by 2.
What are the factors of 60146?
1, 2, 17, 29, 34, 58, 61, 122, 493, 986, 1037, 1769, 2074, 3538, 30073, 60146.
What is 60146 in binary?
1110101011110010 (hexadecimal EAF2, octal 165362).
What is the square root of 60146?
About 245.2468.
Is 60146 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 60146?
60146 is a Harshad number: divisible by its digit sum 17.