The number 32460
32460 is a composite number with 24 divisors. Its prime factorisation is × 3 × 5 × 541. Divisors (24): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 541, 1082, 1623, 2164 … 32460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32460: a Harshad number: divisible by its digit sum 15.
- 2
32460 is composite. Its prime factorisation is
- 3
The divisors add up to 91056; without 32460 itself that is 58596, so 32460 is abundant (58596 is more than 32460). Euler's totient φ(32460) = 8640 numbers up to 32460 share no factor with it.
- 4
The digits of 32460 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 116 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32460 = 2^{2} \times 3 \times 5 \times 541 \]32460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 91056 |
| Euler totient φ(n) | 8640 |
| Square | 1053651600 |
| Cube | 34201530936000 |
| Square root | 180.166590 (= 2√8115) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 116 |
| Scientific notation | 3.246 × |
32460 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand four hundred and sixty |
| Binary (base 2) | 111111011001100 |
| Octal (base 8) | 77314 |
| Hexadecimal (base 16) | 7ECC |
| Base 3 | 1122112020 |
| As time | 32460 seconds = 9 h 1 min 0 s |
Is 32460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32460 ÷ 2 = 16230) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (32460 ÷ 3 = 10820) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (32460 ÷ 4 = 8115) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (32460 ÷ 5 = 6492) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (32460 ÷ 6 = 5410) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (32460 ÷ 10 = 3246) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (32460 ÷ 12 = 2705) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32460 a prime number?
No. 32460 = × 3 × 5 × 541, so it is divisible by 2.
What are the factors of 32460?
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 541, 1082, 1623, 2164, 2705, 3246, 5410, 6492, 8115, 10820, 16230, 32460.
What is 32460 in binary?
111111011001100 (hexadecimal 7ECC, octal 77314).
What is the square root of 32460?
About 180.1666, exactly 2√8115.
Is 32460 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 32460?
32460 is a Harshad number: divisible by its digit sum 15.