The number 18626
18626 is a composite number with 8 divisors. Its prime factorisation is 2 × 67 × 139. Divisors (8): 1, 2, 67, 134, 139, 278, 9313, 18626.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
18626 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
18626 is composite. Its prime factorisation is
- 3
The divisors add up to 28560; without 18626 itself that is 9934, so 18626 is deficient (9934 is less than 18626). Euler's totient φ(18626) = 9108 numbers up to 18626 share no factor with it.
- 4
The digits of 18626 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 110 steps to reach 1.
LaTeX source of the formulas on this page
\[ 18626 = 2 \times 67 \times 139 \]
18626 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 28560 |
| Euler totient φ(n) | 9108 |
| Square | 346927876 |
| Cube | 6461878618376 |
| Square root | 136.477104 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 110 |
| Scientific notation | 1.8626 × |
18626 in other forms
| Form | Value |
|---|---|
| In words | eighteen thousand six hundred and twenty-six |
| Binary (base 2) | 100100011000010 |
| Octal (base 8) | 44302 |
| Hexadecimal (base 16) | 48C2 |
| Base 3 | 221112212 |
| As time | 18626 seconds = 5 h 10 min 26 s |
Is 18626 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (18626 ÷ 2 = 9313) | 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 1) | 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 6) | 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 2) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 18626 a prime number?
No. 18626 = 2 × 67 × 139, so it is divisible by 2.
What are the factors of 18626?
1, 2, 67, 134, 139, 278, 9313, 18626.
What is 18626 in binary?
100100011000010 (hexadecimal 48C2, octal 44302).
What is the square root of 18626?
About 136.4771.
Is 18626 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 18626?
It is a composite number with 8 divisors.