The number 1460
1460 is a composite number with 12 divisors. Its prime factorisation is × 5 × 73. Divisors (12): 1, 2, 4, 5, 10, 20, 73, 146, 292, 365, 730, 1460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1460 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1460 is composite. Its prime factorisation is
- 3
The divisors add up to 3108; without 1460 itself that is 1648, so 1460 is abundant (1648 is more than 1460). Euler's totient φ(1460) = 576 numbers up to 1460 share no factor with it.
- 4
The digits of 1460 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1460 = 2^{2} \times 5 \times 73 \]1460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 3108 |
| Euler totient φ(n) | 576 |
| Square | 2131600 |
| Cube | 3112136000 |
| Square root | 38.209946 (= 2√365) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 96 |
| Scientific notation | 1.46 × |
1460 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and sixty |
| Roman numerals | MCDLX |
| Binary (base 2) | 10110110100 |
| Octal (base 8) | 2664 |
| Hexadecimal (base 16) | 5B4 |
| Base 3 | 2000002 |
| As time | 1460 seconds = 24 min 20 s |
Is 1460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1460 ÷ 2 = 730) | 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 (1460 ÷ 4 = 365) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (1460 ÷ 5 = 292) | 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 4) | 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 (1460 ÷ 10 = 146) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 1460 a prime number?
No. 1460 = × 5 × 73, so it is divisible by 2.
What are the factors of 1460?
1, 2, 4, 5, 10, 20, 73, 146, 292, 365, 730, 1460.
What is 1460 in binary?
10110110100 (hexadecimal 5B4, octal 2664).
What is the square root of 1460?
About 38.2099, exactly 2√365.
What is 1460 in Roman numerals?
MCDLX.
Is 1460 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 1460?
It is a composite number with 12 divisors.