The number 15712
15712 is a composite number with 12 divisors. Its prime factorisation is × 491. Divisors (12): 1, 2, 4, 8, 16, 32, 491, 982, 1964, 3928, 7856, 15712.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15712: a Harshad number: divisible by its digit sum 16.
- 2
15712 is composite. Its prime factorisation is
- 3
The divisors add up to 30996; without 15712 itself that is 15284, so 15712 is deficient (15284 is less than 15712). Euler's totient φ(15712) = 7840 numbers up to 15712 share no factor with it.
- 4
The digits of 15712 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15712 = 2^{5} \times 491 \]15712 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 30996 |
| Euler totient φ(n) | 7840 |
| Square | 246866944 |
| Cube | 3878773424128 |
| Square root | 125.347517 (= 4√982) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.5712 × |
15712 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand seven hundred and twelve |
| Binary (base 2) | 11110101100000 |
| Octal (base 8) | 36540 |
| Hexadecimal (base 16) | 3D60 |
| Base 3 | 210112221 |
| As time | 15712 seconds = 4 h 21 min 52 s |
Is 15712 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15712 ÷ 2 = 7856) | 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 | Yes (15712 ÷ 4 = 3928) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 | Yes (15712 ÷ 8 = 1964) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15712 a prime number?
No. 15712 = × 491, so it is divisible by 2.
What are the factors of 15712?
1, 2, 4, 8, 16, 32, 491, 982, 1964, 3928, 7856, 15712.
What is 15712 in binary?
11110101100000 (hexadecimal 3D60, octal 36540).
What is the square root of 15712?
About 125.3475, exactly 4√982.
Is 15712 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 15712?
15712 is a Harshad number: divisible by its digit sum 16.