The number 670
670 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 67. Divisors (8): 1, 2, 5, 10, 67, 134, 335, 670.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
670 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
670 is composite. Its prime factorisation is
- 3
The divisors add up to 1224; without 670 itself that is 554, so 670 is deficient (554 is less than 670). Euler's totient φ(670) = 264 numbers up to 670 share no factor with it.
- 4
The digits of 670 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 69 steps to reach 1.
LaTeX source of the formulas on this page
\[ 670 = 2 \times 5 \times 67 \]
670 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 1224 |
| Euler totient φ(n) | 264 |
| Square | 448900 |
| Cube | 300763000 |
| Square root | 25.884358 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 69 |
| Scientific notation | 6.7 × |
670 in other forms
| Form | Value |
|---|---|
| In words | six hundred and seventy |
| Roman numerals | DCLXX |
| Binary (base 2) | 1010011110 |
| Octal (base 8) | 1236 |
| Hexadecimal (base 16) | 29E |
| Base 3 | 220211 |
| As time | 670 seconds = 11 min 10 s |
Is 670 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (670 ÷ 2 = 335) | 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 (670 ÷ 5 = 134) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (670 ÷ 10 = 67) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 670 a prime number?
No. 670 = 2 × 5 × 67, so it is divisible by 2.
What are the factors of 670?
1, 2, 5, 10, 67, 134, 335, 670.
What is 670 in binary?
1010011110 (hexadecimal 29E, octal 1236).
What is the square root of 670?
About 25.8844.
What is 670 in Roman numerals?
DCLXX.
Is 670 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 670?
It is a composite number with 8 divisors.