The number 15989
15989 is a composite number with 4 divisors. Its prime factorisation is 59 × 271. Divisors (4): 1, 59, 271, 15989.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15989: a semiprime: 59 × 271, the product of two primes.
- 2
15989 is composite. Its prime factorisation is
- 3
The divisors add up to 16320; without 15989 itself that is 331, so 15989 is deficient (331 is less than 15989). Euler's totient φ(15989) = 15660 numbers up to 15989 share no factor with it.
- 4
The digits of 15989 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15989 = 59 \times 271 \]
15989 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16320 |
| Euler totient φ(n) | 15660 |
| Square | 255648121 |
| Cube | 4087557806669 |
| Square root | 126.447618 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5989 × |
15989 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and eighty-nine |
| Binary (base 2) | 11111001110101 |
| Octal (base 8) | 37165 |
| Hexadecimal (base 16) | 3E75 |
| Base 3 | 210221012 |
| As time | 15989 seconds = 4 h 26 min 29 s |
Is 15989 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 5) | 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 | No (remainder 9) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15989 a prime number?
No. 15989 = 59 × 271, so it is divisible by 59.
What are the factors of 15989?
1, 59, 271, 15989.
What is 15989 in binary?
11111001110101 (hexadecimal 3E75, octal 37165).
What is the square root of 15989?
About 126.4476.
Is 15989 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 15989?
15989 is a semiprime: 59 × 271, the product of two primes.