The number 14613
14613 is a composite number with 4 divisors. Its prime factorisation is 3 × 4871. Divisors (4): 1, 3, 4871, 14613.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14613: a semiprime: 3 × 4871, the product of two primes.
- 2
14613 is composite. Its prime factorisation is
- 3
The divisors add up to 19488; without 14613 itself that is 4875, so 14613 is deficient (4875 is less than 14613). Euler's totient φ(14613) = 9740 numbers up to 14613 share no factor with it.
- 4
The digits of 14613 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14613 = 3 \times 4871 \]
14613 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 19488 |
| Euler totient φ(n) | 9740 |
| Square | 213539769 |
| Cube | 3120456644397 |
| Square root | 120.884242 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.4613 × |
14613 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand six hundred and thirteen |
| Binary (base 2) | 11100100010101 |
| Octal (base 8) | 34425 |
| Hexadecimal (base 16) | 3915 |
| Base 3 | 202001020 |
| As time | 14613 seconds = 4 h 3 min 33 s |
Is 14613 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 | Yes (14613 ÷ 3 = 4871) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14613 a prime number?
No. 14613 = 3 × 4871, so it is divisible by 3.
What are the factors of 14613?
1, 3, 4871, 14613.
What is 14613 in binary?
11100100010101 (hexadecimal 3915, octal 34425).
What is the square root of 14613?
About 120.8842.
Is 14613 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 14613?
14613 is a semiprime: 3 × 4871, the product of two primes.