The number 11670
11670 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 389. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 389, 778, 1167, 1945, 2334, 3890, 5835, 11670.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11670: a Harshad number: divisible by its digit sum 15.
- 2
11670 is composite. Its prime factorisation is
- 3
The divisors add up to 28080; without 11670 itself that is 16410, so 11670 is abundant (16410 is more than 11670). Euler's totient φ(11670) = 3104 numbers up to 11670 share no factor with it.
- 4
The digits of 11670 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 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11670 = 2 \times 3 \times 5 \times 389 \]
11670 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 28080 |
| Euler totient φ(n) | 3104 |
| Square | 136188900 |
| Cube | 1589324463000 |
| Square root | 108.027774 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.167 × |
11670 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand six hundred and seventy |
| Binary (base 2) | 10110110010110 |
| Octal (base 8) | 26626 |
| Hexadecimal (base 16) | 2D96 |
| Base 3 | 121000020 |
| As time | 11670 seconds = 3 h 14 min 30 s |
Is 11670 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11670 ÷ 2 = 5835) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11670 ÷ 3 = 3890) | 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 (11670 ÷ 5 = 2334) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (11670 ÷ 6 = 1945) | 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 6) | 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 (11670 ÷ 10 = 1167) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 11670 a prime number?
No. 11670 = 2 × 3 × 5 × 389, so it is divisible by 2.
What are the factors of 11670?
1, 2, 3, 5, 6, 10, 15, 30, 389, 778, 1167, 1945, 2334, 3890, 5835, 11670.
What is 11670 in binary?
10110110010110 (hexadecimal 2D96, octal 26626).
What is the square root of 11670?
About 108.0278.
Is 11670 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 11670?
11670 is a Harshad number: divisible by its digit sum 15.