The number 15969
15969 is a composite number with 4 divisors. Its prime factorisation is 3 × 5323. Divisors (4): 1, 3, 5323, 15969.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15969: a semiprime: 3 × 5323, the product of two primes.
- 2
15969 is composite. Its prime factorisation is
- 3
The divisors add up to 21296; without 15969 itself that is 5327, so 15969 is deficient (5327 is less than 15969). Euler's totient φ(15969) = 10644 numbers up to 15969 share no factor with it.
- 4
The digits of 15969 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 190 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15969 = 3 \times 5323 \]
15969 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 21296 |
| Euler totient φ(n) | 10644 |
| Square | 255008961 |
| Cube | 4072238098209 |
| Square root | 126.368509 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 190 |
| Scientific notation | 1.5969 × |
15969 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and sixty-nine |
| Binary (base 2) | 11111001100001 |
| Octal (base 8) | 37141 |
| Hexadecimal (base 16) | 3E61 |
| Base 3 | 210220110 |
| As time | 15969 seconds = 4 h 26 min 9 s |
Is 15969 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 (15969 ÷ 3 = 5323) | 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 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 3) | 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 8) | 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 15969 a prime number?
No. 15969 = 3 × 5323, so it is divisible by 3.
What are the factors of 15969?
1, 3, 5323, 15969.
What is 15969 in binary?
11111001100001 (hexadecimal 3E61, octal 37141).
What is the square root of 15969?
About 126.3685.
Is 15969 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 15969?
15969 is a semiprime: 3 × 5323, the product of two primes.