The number 15690
15690 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 523. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 523, 1046, 1569, 2615, 3138, 5230, 7845, 15690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15690 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15690 is composite. Its prime factorisation is
- 3
The divisors add up to 37728; without 15690 itself that is 22038, so 15690 is abundant (22038 is more than 15690). Euler's totient φ(15690) = 4176 numbers up to 15690 share no factor with it.
- 4
The digits of 15690 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15690 = 2 \times 3 \times 5 \times 523 \]
15690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 37728 |
| Euler totient φ(n) | 4176 |
| Square | 246176100 |
| Cube | 3862503009000 |
| Square root | 125.259730 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 177 |
| Scientific notation | 1.569 × |
15690 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand six hundred and ninety |
| Binary (base 2) | 11110101001010 |
| Octal (base 8) | 36512 |
| Hexadecimal (base 16) | 3D4A |
| Base 3 | 210112010 |
| As time | 15690 seconds = 4 h 21 min 30 s |
Is 15690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15690 ÷ 2 = 7845) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15690 ÷ 3 = 5230) | 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 (15690 ÷ 5 = 3138) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15690 ÷ 6 = 2615) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (15690 ÷ 10 = 1569) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15690 a prime number?
No. 15690 = 2 × 3 × 5 × 523, so it is divisible by 2.
What are the factors of 15690?
1, 2, 3, 5, 6, 10, 15, 30, 523, 1046, 1569, 2615, 3138, 5230, 7845, 15690.
What is 15690 in binary?
11110101001010 (hexadecimal 3D4A, octal 36512).
What is the square root of 15690?
About 125.2597.
Is 15690 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 15690?
It is a composite number with 16 divisors.