The number 13390
13390 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 13 × 103. Divisors (16): 1, 2, 5, 10, 13, 26, 65, 103, 130, 206, 515, 1030, 1339, 2678, 6695, 13390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13390: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
13390 is composite. Its prime factorisation is
- 3
The divisors add up to 26208; without 13390 itself that is 12818, so 13390 is deficient (12818 is less than 13390). Euler's totient φ(13390) = 4896 numbers up to 13390 share no factor with it.
- 4
The digits of 13390 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13390 = 2 \times 5 \times 13 \times 103 \]
13390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 26208 |
| Euler totient φ(n) | 4896 |
| Square | 179292100 |
| Cube | 2400721219000 |
| Square root | 115.715168 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.339 × |
13390 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand three hundred and ninety |
| Binary (base 2) | 11010001001110 |
| Octal (base 8) | 32116 |
| Hexadecimal (base 16) | 344E |
| Base 3 | 200100221 |
| As time | 13390 seconds = 3 h 43 min 10 s |
Is 13390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13390 ÷ 2 = 6695) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 (13390 ÷ 5 = 2678) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (13390 ÷ 10 = 1339) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13390 a prime number?
No. 13390 = 2 × 5 × 13 × 103, so it is divisible by 2.
What are the factors of 13390?
1, 2, 5, 10, 13, 26, 65, 103, 130, 206, 515, 1030, 1339, 2678, 6695, 13390.
What is 13390 in binary?
11010001001110 (hexadecimal 344E, octal 32116).
What is the square root of 13390?
About 115.7152.
Is 13390 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 13390?
13390 is a happy number: repeatedly adding the squares of its digits reaches 1.