The number 13460
13460 is a composite number with 12 divisors. Its prime factorisation is × 5 × 673. Divisors (12): 1, 2, 4, 5, 10, 20, 673, 1346, 2692, 3365, 6730, 13460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13460 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13460 is composite. Its prime factorisation is
- 3
The divisors add up to 28308; without 13460 itself that is 14848, so 13460 is abundant (14848 is more than 13460). Euler's totient φ(13460) = 5376 numbers up to 13460 share no factor with it.
- 4
The digits of 13460 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13460 = 2^{2} \times 5 \times 673 \]13460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 28308 |
| Euler totient φ(n) | 5376 |
| Square | 181171600 |
| Cube | 2438569736000 |
| Square root | 116.017240 (= 2√3365) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.346 × |
13460 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand four hundred and sixty |
| Binary (base 2) | 11010010010100 |
| Octal (base 8) | 32224 |
| Hexadecimal (base 16) | 3494 |
| Base 3 | 200110112 |
| As time | 13460 seconds = 3 h 44 min 20 s |
Is 13460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13460 ÷ 2 = 6730) | 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 (13460 ÷ 4 = 3365) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (13460 ÷ 5 = 2692) | 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 6) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (13460 ÷ 10 = 1346) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 13460 a prime number?
No. 13460 = × 5 × 673, so it is divisible by 2.
What are the factors of 13460?
1, 2, 4, 5, 10, 20, 673, 1346, 2692, 3365, 6730, 13460.
What is 13460 in binary?
11010010010100 (hexadecimal 3494, octal 32224).
What is the square root of 13460?
About 116.0172, exactly 2√3365.
Is 13460 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 13460?
It is a composite number with 12 divisors.