The number 15689
15689 is a composite number with 4 divisors. Its prime factorisation is 29 × 541. Divisors (4): 1, 29, 541, 15689.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15689: a Harshad number: divisible by its digit sum 29; a semiprime: 29 × 541, the product of two primes.
- 2
15689 is composite. Its prime factorisation is
- 3
The divisors add up to 16260; without 15689 itself that is 571, so 15689 is deficient (571 is less than 15689). Euler's totient φ(15689) = 15120 numbers up to 15689 share no factor with it.
- 4
The digits of 15689 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15689 = 29 \times 541 \]
15689 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16260 |
| Euler totient φ(n) | 15120 |
| Square | 246144721 |
| Cube | 3861764527769 |
| Square root | 125.255738 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.5689 × |
15689 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand six hundred and eighty-nine |
| Binary (base 2) | 11110101001001 |
| Octal (base 8) | 36511 |
| Hexadecimal (base 16) | 3D49 |
| Base 3 | 210112002 |
| As time | 15689 seconds = 4 h 21 min 29 s |
Is 15689 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 3) | 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 15689 a prime number?
No. 15689 = 29 × 541, so it is divisible by 29.
What are the factors of 15689?
1, 29, 541, 15689.
What is 15689 in binary?
11110101001001 (hexadecimal 3D49, octal 36511).
What is the square root of 15689?
About 125.2557.
Is 15689 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 15689?
15689 is a Harshad number: divisible by its digit sum 29; a semiprime: 29 × 541, the product of two primes.