The number 30561
30561 is a composite number with 8 divisors. Its prime factorisation is 3 × 61 × 167. Divisors (8): 1, 3, 61, 167, 183, 501, 10187, 30561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
30561 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
30561 is composite. Its prime factorisation is
- 3
The divisors add up to 41664; without 30561 itself that is 11103, so 30561 is deficient (11103 is less than 30561). Euler's totient φ(30561) = 19920 numbers up to 30561 share no factor with it.
- 4
The digits of 30561 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 147 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30561 = 3 \times 61 \times 167 \]
30561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 41664 |
| Euler totient φ(n) | 19920 |
| Square | 933974721 |
| Cube | 28543201448481 |
| Square root | 174.817047 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 147 |
| Scientific notation | 3.0561 × |
30561 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand five hundred and sixty-one |
| Binary (base 2) | 111011101100001 |
| Octal (base 8) | 73541 |
| Hexadecimal (base 16) | 7761 |
| Base 3 | 1112220220 |
| As time | 30561 seconds = 8 h 29 min 21 s |
Is 30561 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 (30561 ÷ 3 = 10187) | 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 1) | 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 1) | 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 1) | 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 30561 a prime number?
No. 30561 = 3 × 61 × 167, so it is divisible by 3.
What are the factors of 30561?
1, 3, 61, 167, 183, 501, 10187, 30561.
What is 30561 in binary?
111011101100001 (hexadecimal 7761, octal 73541).
What is the square root of 30561?
About 174.8170.
Is 30561 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 30561?
It is a composite number with 8 divisors.