The number 18629
18629 is a composite number with 4 divisors. Its prime factorisation is 13 × 1433. Divisors (4): 1, 13, 1433, 18629.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 18629: a semiprime: 13 × 1433, the product of two primes.
- 2
18629 is composite. Its prime factorisation is
- 3
The divisors add up to 20076; without 18629 itself that is 1447, so 18629 is deficient (1447 is less than 18629). Euler's totient φ(18629) = 17184 numbers up to 18629 share no factor with it.
- 4
The digits of 18629 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 154 steps to reach 1.
LaTeX source of the formulas on this page
\[ 18629 = 13 \times 1433 \]
18629 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20076 |
| Euler totient φ(n) | 17184 |
| Square | 347039641 |
| Cube | 6465001472189 |
| Square root | 136.488095 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 154 |
| Scientific notation | 1.8629 × |
18629 in other forms
| Form | Value |
|---|---|
| In words | eighteen thousand six hundred and twenty-nine |
| Binary (base 2) | 100100011000101 |
| Octal (base 8) | 44305 |
| Hexadecimal (base 16) | 48C5 |
| Base 3 | 221112222 |
| As time | 18629 seconds = 5 h 10 min 29 s |
Is 18629 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 | No (remainder 2) | 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 5) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 18629 a prime number?
No. 18629 = 13 × 1433, so it is divisible by 13.
What are the factors of 18629?
1, 13, 1433, 18629.
What is 18629 in binary?
100100011000101 (hexadecimal 48C5, octal 44305).
What is the square root of 18629?
About 136.4881.
Is 18629 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 18629?
18629 is a semiprime: 13 × 1433, the product of two primes.