The number 30563
30563 is a composite number with 4 divisors. Its prime factorisation is 13 × 2351. Divisors (4): 1, 13, 2351, 30563.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30563: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 2351, the product of two primes.
- 2
30563 is composite. Its prime factorisation is
- 3
The divisors add up to 32928; without 30563 itself that is 2365, so 30563 is deficient (2365 is less than 30563). Euler's totient φ(30563) = 28200 numbers up to 30563 share no factor with it.
- 4
The digits of 30563 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 33 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30563 = 13 \times 2351 \]
30563 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 32928 |
| Euler totient φ(n) | 28200 |
| Square | 934096969 |
| Cube | 28548805663547 |
| Square root | 174.822767 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 33 |
| Scientific notation | 3.0563 × |
30563 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand five hundred and sixty-three |
| Binary (base 2) | 111011101100011 |
| Octal (base 8) | 73543 |
| Hexadecimal (base 16) | 7763 |
| Base 3 | 1112220222 |
| As time | 30563 seconds = 8 h 29 min 23 s |
Is 30563 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 3) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 3) | 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 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30563 a prime number?
No. 30563 = 13 × 2351, so it is divisible by 13.
What are the factors of 30563?
1, 13, 2351, 30563.
What is 30563 in binary?
111011101100011 (hexadecimal 7763, octal 73543).
What is the square root of 30563?
About 174.8228.
Is 30563 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 30563?
30563 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 2351, the product of two primes.