The number 12638
12638 is a composite number with 8 divisors. Its prime factorisation is 2 × 71 × 89. Divisors (8): 1, 2, 71, 89, 142, 178, 6319, 12638.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12638 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12638 is composite. Its prime factorisation is
- 3
The divisors add up to 19440; without 12638 itself that is 6802, so 12638 is deficient (6802 is less than 12638). Euler's totient φ(12638) = 6160 numbers up to 12638 share no factor with it.
- 4
The digits of 12638 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 200 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12638 = 2 \times 71 \times 89 \]
12638 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19440 |
| Euler totient φ(n) | 6160 |
| Square | 159719044 |
| Cube | 2018529278072 |
| Square root | 112.418860 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 200 |
| Scientific notation | 1.2638 × |
12638 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand six hundred and thirty-eight |
| Binary (base 2) | 11000101011110 |
| Octal (base 8) | 30536 |
| Hexadecimal (base 16) | 315E |
| Base 3 | 122100002 |
| As time | 12638 seconds = 3 h 30 min 38 s |
Is 12638 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12638 ÷ 2 = 6319) | 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 | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 10) | 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 12638 a prime number?
No. 12638 = 2 × 71 × 89, so it is divisible by 2.
What are the factors of 12638?
1, 2, 71, 89, 142, 178, 6319, 12638.
What is 12638 in binary?
11000101011110 (hexadecimal 315E, octal 30536).
What is the square root of 12638?
About 112.4189.
Is 12638 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 12638?
It is a composite number with 8 divisors.