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