The number 15638
15638 is a composite number with 8 divisors. Its prime factorisation is 2 × 7 × 1117. Divisors (8): 1, 2, 7, 14, 1117, 2234, 7819, 15638.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15638 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15638 is composite. Its prime factorisation is
- 3
The divisors add up to 26832; without 15638 itself that is 11194, so 15638 is deficient (11194 is less than 15638). Euler's totient φ(15638) = 6696 numbers up to 15638 share no factor with it.
- 4
The digits of 15638 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15638 = 2 \times 7 \times 1117 \]
15638 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 26832 |
| Euler totient φ(n) | 6696 |
| Square | 244547044 |
| Cube | 3824226674072 |
| Square root | 125.051989 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.5638 × |
15638 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand six hundred and thirty-eight |
| Binary (base 2) | 11110100010110 |
| Octal (base 8) | 36426 |
| Hexadecimal (base 16) | 3D16 |
| Base 3 | 210110012 |
| As time | 15638 seconds = 4 h 20 min 38 s |
Is 15638 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15638 ÷ 2 = 7819) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (15638 ÷ 7 = 2234) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15638 a prime number?
No. 15638 = 2 × 7 × 1117, so it is divisible by 2.
What are the factors of 15638?
1, 2, 7, 14, 1117, 2234, 7819, 15638.
What is 15638 in binary?
11110100010110 (hexadecimal 3D16, octal 36426).
What is the square root of 15638?
About 125.0520.
Is 15638 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 15638?
It is a composite number with 8 divisors.