The number 15669
15669 is a composite number with 6 divisors. Its prime factorisation is × 1741. Divisors (6): 1, 3, 9, 1741, 5223, 15669.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15669 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15669 is composite. Its prime factorisation is
- 3
The divisors add up to 22646; without 15669 itself that is 6977, so 15669 is deficient (6977 is less than 15669). Euler's totient φ(15669) = 10440 numbers up to 15669 share no factor with it.
- 4
The digits of 15669 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15669 = 3^{2} \times 1741 \]15669 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 22646 |
| Euler totient φ(n) | 10440 |
| Square | 245517561 |
| Cube | 3847014663309 |
| Square root | 125.175876 (= 3√1741) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5669 × |
15669 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand six hundred and sixty-nine |
| Binary (base 2) | 11110100110101 |
| Octal (base 8) | 36465 |
| Hexadecimal (base 16) | 3D35 |
| Base 3 | 210111100 |
| As time | 15669 seconds = 4 h 21 min 9 s |
Is 15669 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 | Yes (15669 ÷ 3 = 5223) | 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 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (15669 ÷ 9 = 1741) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15669 a prime number?
No. 15669 = × 1741, so it is divisible by 3.
What are the factors of 15669?
1, 3, 9, 1741, 5223, 15669.
What is 15669 in binary?
11110100110101 (hexadecimal 3D35, octal 36465).
What is the square root of 15669?
About 125.1759, exactly 3√1741.
Is 15669 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 15669?
It is a composite number with 6 divisors.