The number 10670
10670 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 11 × 97. Divisors (16): 1, 2, 5, 10, 11, 22, 55, 97, 110, 194, 485, 970, 1067, 2134, 5335, 10670.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10670: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
10670 is composite. Its prime factorisation is
- 3
The divisors add up to 21168; without 10670 itself that is 10498, so 10670 is deficient (10498 is less than 10670). Euler's totient φ(10670) = 3840 numbers up to 10670 share no factor with it.
- 4
The digits of 10670 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10670 = 2 \times 5 \times 11 \times 97 \]
10670 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 21168 |
| Euler totient φ(n) | 3840 |
| Square | 113848900 |
| Cube | 1214767763000 |
| Square root | 103.295692 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 47 |
| Scientific notation | 1.067 × |
10670 in other forms
| Form | Value |
|---|---|
| In words | ten thousand six hundred and seventy |
| Binary (base 2) | 10100110101110 |
| Octal (base 8) | 24656 |
| Hexadecimal (base 16) | 29AE |
| Base 3 | 112122012 |
| As time | 10670 seconds = 2 h 57 min 50 s |
Is 10670 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10670 ÷ 2 = 5335) | 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 (10670 ÷ 5 = 2134) | 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 2) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (10670 ÷ 10 = 1067) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (10670 ÷ 11 = 970) | 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 10670 a prime number?
No. 10670 = 2 × 5 × 11 × 97, so it is divisible by 2.
What are the factors of 10670?
1, 2, 5, 10, 11, 22, 55, 97, 110, 194, 485, 970, 1067, 2134, 5335, 10670.
What is 10670 in binary?
10100110101110 (hexadecimal 29AE, octal 24656).
What is the square root of 10670?
About 103.2957.
Is 10670 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 10670?
10670 is a happy number: repeatedly adding the squares of its digits reaches 1.