The number 13290
13290 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 443. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 443, 886, 1329, 2215, 2658, 4430, 6645, 13290.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13290: a Harshad number: divisible by its digit sum 15.
- 2
13290 is composite. Its prime factorisation is
- 3
The divisors add up to 31968; without 13290 itself that is 18678, so 13290 is abundant (18678 is more than 13290). Euler's totient φ(13290) = 3536 numbers up to 13290 share no factor with it.
- 4
The digits of 13290 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 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13290 = 2 \times 3 \times 5 \times 443 \]
13290 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 31968 |
| Euler totient φ(n) | 3536 |
| Square | 176624100 |
| Cube | 2347334289000 |
| Square root | 115.282262 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 138 |
| Scientific notation | 1.329 × |
13290 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand two hundred and ninety |
| Binary (base 2) | 11001111101010 |
| Octal (base 8) | 31752 |
| Hexadecimal (base 16) | 33EA |
| Base 3 | 200020020 |
| As time | 13290 seconds = 3 h 41 min 30 s |
Is 13290 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13290 ÷ 2 = 6645) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (13290 ÷ 3 = 4430) | 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 (13290 ÷ 5 = 2658) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (13290 ÷ 6 = 2215) | 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 2) | 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 (13290 ÷ 10 = 1329) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13290 a prime number?
No. 13290 = 2 × 3 × 5 × 443, so it is divisible by 2.
What are the factors of 13290?
1, 2, 3, 5, 6, 10, 15, 30, 443, 886, 1329, 2215, 2658, 4430, 6645, 13290.
What is 13290 in binary?
11001111101010 (hexadecimal 33EA, octal 31752).
What is the square root of 13290?
About 115.2823.
Is 13290 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 13290?
13290 is a Harshad number: divisible by its digit sum 15.