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