The number 60460
60460 is a composite number with 12 divisors. Its prime factorisation is × 5 × 3023. Divisors (12): 1, 2, 4, 5, 10, 20, 3023, 6046, 12092, 15115, 30230, 60460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
60460 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
60460 is composite. Its prime factorisation is
- 3
The divisors add up to 127008; without 60460 itself that is 66548, so 60460 is abundant (66548 is more than 60460). Euler's totient φ(60460) = 24176 numbers up to 60460 share no factor with it.
- 4
The digits of 60460 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60460 = 2^{2} \times 5 \times 3023 \]60460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 127008 |
| Euler totient φ(n) | 24176 |
| Square | 3655411600 |
| Cube | 221006185336000 |
| Square root | 245.886153 (= 2√15115) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 91 |
| Scientific notation | 6.046 × |
60460 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand four hundred and sixty |
| Binary (base 2) | 1110110000101100 |
| Octal (base 8) | 166054 |
| Hexadecimal (base 16) | EC2C |
| Base 3 | 10001221021 |
| As time | 60460 seconds = 16 h 47 min 40 s |
Is 60460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (60460 ÷ 2 = 30230) | 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 | Yes (60460 ÷ 4 = 15115) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (60460 ÷ 5 = 12092) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (60460 ÷ 10 = 6046) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60460 a prime number?
No. 60460 = × 5 × 3023, so it is divisible by 2.
What are the factors of 60460?
1, 2, 4, 5, 10, 20, 3023, 6046, 12092, 15115, 30230, 60460.
What is 60460 in binary?
1110110000101100 (hexadecimal EC2C, octal 166054).
What is the square root of 60460?
About 245.8862, exactly 2√15115.
Is 60460 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 60460?
It is a composite number with 12 divisors.