The number 16670
16670 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1667. Divisors (8): 1, 2, 5, 10, 1667, 3334, 8335, 16670.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16670 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16670 is composite. Its prime factorisation is
- 3
The divisors add up to 30024; without 16670 itself that is 13354, so 16670 is deficient (13354 is less than 16670). Euler's totient φ(16670) = 6664 numbers up to 16670 share no factor with it.
- 4
The digits of 16670 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16670 = 2 \times 5 \times 1667 \]
16670 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 30024 |
| Euler totient φ(n) | 6664 |
| Square | 277888900 |
| Cube | 4632407963000 |
| Square root | 129.112354 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 115 |
| Scientific notation | 1.667 × |
16670 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand six hundred and seventy |
| Binary (base 2) | 100000100011110 |
| Octal (base 8) | 40436 |
| Hexadecimal (base 16) | 411E |
| Base 3 | 211212102 |
| As time | 16670 seconds = 4 h 37 min 50 s |
Is 16670 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16670 ÷ 2 = 8335) | 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 (16670 ÷ 5 = 3334) | 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 3) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (16670 ÷ 10 = 1667) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 16670 a prime number?
No. 16670 = 2 × 5 × 1667, so it is divisible by 2.
What are the factors of 16670?
1, 2, 5, 10, 1667, 3334, 8335, 16670.
What is 16670 in binary?
100000100011110 (hexadecimal 411E, octal 40436).
What is the square root of 16670?
About 129.1124.
Is 16670 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 16670?
It is a composite number with 8 divisors.