The number 15967
15967 is a composite number with 4 divisors. Its prime factorisation is 7 × 2281. Divisors (4): 1, 7, 2281, 15967.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15967: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 2281, the product of two primes.
- 2
15967 is composite. Its prime factorisation is
- 3
The divisors add up to 18256; without 15967 itself that is 2289, so 15967 is deficient (2289 is less than 15967). Euler's totient φ(15967) = 13680 numbers up to 15967 share no factor with it.
- 4
The digits of 15967 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15967 = 7 \times 2281 \]
15967 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 18256 |
| Euler totient φ(n) | 13680 |
| Square | 254945089 |
| Cube | 4070708236063 |
| Square root | 126.360595 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5967 × |
15967 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and sixty-seven |
| Binary (base 2) | 11111001011111 |
| Octal (base 8) | 37137 |
| Hexadecimal (base 16) | 3E5F |
| Base 3 | 210220101 |
| As time | 15967 seconds = 4 h 26 min 7 s |
Is 15967 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 3) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (15967 ÷ 7 = 2281) | 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 7) | 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 | No (remainder 7) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15967 a prime number?
No. 15967 = 7 × 2281, so it is divisible by 7.
What are the factors of 15967?
1, 7, 2281, 15967.
What is 15967 in binary?
11111001011111 (hexadecimal 3E5F, octal 37137).
What is the square root of 15967?
About 126.3606.
Is 15967 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 15967?
15967 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 2281, the product of two primes.