The number 15639
15639 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 401. Divisors (8): 1, 3, 13, 39, 401, 1203, 5213, 15639.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15639 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15639 is composite. Its prime factorisation is
- 3
The divisors add up to 22512; without 15639 itself that is 6873, so 15639 is deficient (6873 is less than 15639). Euler's totient φ(15639) = 9600 numbers up to 15639 share no factor with it.
- 4
The digits of 15639 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15639 = 3 \times 13 \times 401 \]
15639 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22512 |
| Euler totient φ(n) | 9600 |
| Square | 244578321 |
| Cube | 3824960362119 |
| Square root | 125.055987 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.5639 × |
15639 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand six hundred and thirty-nine |
| Binary (base 2) | 11110100010111 |
| Octal (base 8) | 36427 |
| Hexadecimal (base 16) | 3D17 |
| Base 3 | 210110020 |
| As time | 15639 seconds = 4 h 20 min 39 s |
Is 15639 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 (15639 ÷ 3 = 5213) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15639 a prime number?
No. 15639 = 3 × 13 × 401, so it is divisible by 3.
What are the factors of 15639?
1, 3, 13, 39, 401, 1203, 5213, 15639.
What is 15639 in binary?
11110100010111 (hexadecimal 3D17, octal 36427).
What is the square root of 15639?
About 125.0560.
Is 15639 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 15639?
It is a composite number with 8 divisors.