The number 5613
5613 is a composite number with 4 divisors. Its prime factorisation is 3 × 1871. Divisors (4): 1, 3, 1871, 5613.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5613: a semiprime: 3 × 1871, the product of two primes.
- 2
5613 is composite. Its prime factorisation is
- 3
The divisors add up to 7488; without 5613 itself that is 1875, so 5613 is deficient (1875 is less than 5613). Euler's totient φ(5613) = 3740 numbers up to 5613 share no factor with it.
- 4
The digits of 5613 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 129 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5613 = 3 \times 1871 \]
5613 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 7488 |
| Euler totient φ(n) | 3740 |
| Square | 31505769 |
| Cube | 176841881397 |
| Square root | 74.919957 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 129 |
| Scientific notation | 5.613 × |
5613 in other forms
| Form | Value |
|---|---|
| In words | five thousand six hundred and thirteen |
| Binary (base 2) | 1010111101101 |
| Octal (base 8) | 12755 |
| Hexadecimal (base 16) | 15ED |
| Base 3 | 21200220 |
| As time | 5613 seconds = 1 h 33 min 33 s |
Is 5613 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 (5613 ÷ 3 = 1871) | 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 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 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 3) | 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 5613 a prime number?
No. 5613 = 3 × 1871, so it is divisible by 3.
What are the factors of 5613?
1, 3, 1871, 5613.
What is 5613 in binary?
1010111101101 (hexadecimal 15ED, octal 12755).
What is the square root of 5613?
About 74.9200.
Is 5613 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 5613?
5613 is a semiprime: 3 × 1871, the product of two primes.