The number 13690
13690 is a composite number with 12 divisors. Its prime factorisation is 2 × 5 × . Divisors (12): 1, 2, 5, 10, 37, 74, 185, 370, 1369, 2738, 6845, 13690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13690 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13690 is composite. Its prime factorisation is
- 3
The divisors add up to 25326; without 13690 itself that is 11636, so 13690 is deficient (11636 is less than 13690). Euler's totient φ(13690) = 5328 numbers up to 13690 share no factor with it.
- 4
The digits of 13690 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13690 = 2 \times 5 \times 37^{2} \]13690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 25326 |
| Euler totient φ(n) | 5328 |
| Square | 187416100 |
| Cube | 2565726409000 |
| Square root | 117.004273 (= 37√10) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 151 |
| Scientific notation | 1.369 × |
13690 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand six hundred and ninety |
| Binary (base 2) | 11010101111010 |
| Octal (base 8) | 32572 |
| Hexadecimal (base 16) | 357A |
| Base 3 | 200210001 |
| As time | 13690 seconds = 3 h 48 min 10 s |
Is 13690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13690 ÷ 2 = 6845) | 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 (13690 ÷ 5 = 2738) | 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 5) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (13690 ÷ 10 = 1369) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 13690 a prime number?
No. 13690 = 2 × 5 × , so it is divisible by 2.
What are the factors of 13690?
1, 2, 5, 10, 37, 74, 185, 370, 1369, 2738, 6845, 13690.
What is 13690 in binary?
11010101111010 (hexadecimal 357A, octal 32572).
What is the square root of 13690?
About 117.0043, exactly 37√10.
Is 13690 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 13690?
It is a composite number with 12 divisors.