The number 13670
13670 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1367. Divisors (8): 1, 2, 5, 10, 1367, 2734, 6835, 13670.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13670 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13670 is composite. Its prime factorisation is
- 3
The divisors add up to 24624; without 13670 itself that is 10954, so 13670 is deficient (10954 is less than 13670). Euler's totient φ(13670) = 5464 numbers up to 13670 share no factor with it.
- 4
The digits of 13670 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 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13670 = 2 \times 5 \times 1367 \]
13670 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 24624 |
| Euler totient φ(n) | 5464 |
| Square | 186868900 |
| Cube | 2554497863000 |
| Square root | 116.918775 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.367 × |
13670 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand six hundred and seventy |
| Binary (base 2) | 11010101100110 |
| Octal (base 8) | 32546 |
| Hexadecimal (base 16) | 3566 |
| Base 3 | 200202022 |
| As time | 13670 seconds = 3 h 47 min 50 s |
Is 13670 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13670 ÷ 2 = 6835) | 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 (13670 ÷ 5 = 2734) | 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 6) | 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 (13670 ÷ 10 = 1367) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 13670 a prime number?
No. 13670 = 2 × 5 × 1367, so it is divisible by 2.
What are the factors of 13670?
1, 2, 5, 10, 1367, 2734, 6835, 13670.
What is 13670 in binary?
11010101100110 (hexadecimal 3566, octal 32546).
What is the square root of 13670?
About 116.9188.
Is 13670 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 13670?
It is a composite number with 8 divisors.