The number 13490
13490 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 19 × 71. Divisors (16): 1, 2, 5, 10, 19, 38, 71, 95, 142, 190, 355, 710, 1349, 2698, 6745, 13490.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13490 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13490 is composite. Its prime factorisation is
- 3
The divisors add up to 25920; without 13490 itself that is 12430, so 13490 is deficient (12430 is less than 13490). Euler's totient φ(13490) = 5040 numbers up to 13490 share no factor with it.
- 4
The digits of 13490 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13490 = 2 \times 5 \times 19 \times 71 \]
13490 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 25920 |
| Euler totient φ(n) | 5040 |
| Square | 181980100 |
| Cube | 2454911549000 |
| Square root | 116.146459 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 76 |
| Scientific notation | 1.349 × |
13490 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand four hundred and ninety |
| Binary (base 2) | 11010010110010 |
| Octal (base 8) | 32262 |
| Hexadecimal (base 16) | 34B2 |
| Base 3 | 200111122 |
| As time | 13490 seconds = 3 h 44 min 50 s |
Is 13490 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13490 ÷ 2 = 6745) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (13490 ÷ 5 = 2698) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (13490 ÷ 10 = 1349) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13490 a prime number?
No. 13490 = 2 × 5 × 19 × 71, so it is divisible by 2.
What are the factors of 13490?
1, 2, 5, 10, 19, 38, 71, 95, 142, 190, 355, 710, 1349, 2698, 6745, 13490.
What is 13490 in binary?
11010010110010 (hexadecimal 34B2, octal 32262).
What is the square root of 13490?
About 116.1465.
Is 13490 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 13490?
It is a composite number with 16 divisors.