The number 28460
28460 is a composite number with 12 divisors. Its prime factorisation is × 5 × 1423. Divisors (12): 1, 2, 4, 5, 10, 20, 1423, 2846, 5692, 7115, 14230, 28460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 28460: a Harshad number: divisible by its digit sum 20.
- 2
28460 is composite. Its prime factorisation is
- 3
The divisors add up to 59808; without 28460 itself that is 31348, so 28460 is abundant (31348 is more than 28460). Euler's totient φ(28460) = 11376 numbers up to 28460 share no factor with it.
- 4
The digits of 28460 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 59 steps to reach 1.
LaTeX source of the formulas on this page
\[ 28460 = 2^{2} \times 5 \times 1423 \]28460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 59808 |
| Euler totient φ(n) | 11376 |
| Square | 809971600 |
| Cube | 23051791736000 |
| Square root | 168.700919 (= 2√7115) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 59 |
| Scientific notation | 2.846 × |
28460 in other forms
| Form | Value |
|---|---|
| In words | twenty-eight thousand four hundred and sixty |
| Binary (base 2) | 110111100101100 |
| Octal (base 8) | 67454 |
| Hexadecimal (base 16) | 6F2C |
| Base 3 | 1110001002 |
| As time | 28460 seconds = 7 h 54 min 20 s |
Is 28460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (28460 ÷ 2 = 14230) | 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 | Yes (28460 ÷ 4 = 7115) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (28460 ÷ 5 = 5692) | 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 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (28460 ÷ 10 = 2846) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 28460 a prime number?
No. 28460 = × 5 × 1423, so it is divisible by 2.
What are the factors of 28460?
1, 2, 4, 5, 10, 20, 1423, 2846, 5692, 7115, 14230, 28460.
What is 28460 in binary?
110111100101100 (hexadecimal 6F2C, octal 67454).
What is the square root of 28460?
About 168.7009, exactly 2√7115.
Is 28460 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 28460?
28460 is a Harshad number: divisible by its digit sum 20.