The number 30461
30461 is a composite number with 4 divisors. Its prime factorisation is 83 × 367. Divisors (4): 1, 83, 367, 30461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30461: a semiprime: 83 × 367, the product of two primes.
- 2
30461 is composite. Its prime factorisation is
- 3
The divisors add up to 30912; without 30461 itself that is 451, so 30461 is deficient (451 is less than 30461). Euler's totient φ(30461) = 30012 numbers up to 30461 share no factor with it.
- 4
The digits of 30461 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 59 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30461 = 83 \times 367 \]
30461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 30912 |
| Euler totient φ(n) | 30012 |
| Square | 927872521 |
| Cube | 28263924862181 |
| Square root | 174.530800 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 59 |
| Scientific notation | 3.0461 × |
30461 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand four hundred and sixty-one |
| Binary (base 2) | 111011011111101 |
| Octal (base 8) | 73375 |
| Hexadecimal (base 16) | 76FD |
| Base 3 | 1112210012 |
| As time | 30461 seconds = 8 h 27 min 41 s |
Is 30461 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 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 5) | 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 5) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30461 a prime number?
No. 30461 = 83 × 367, so it is divisible by 83.
What are the factors of 30461?
1, 83, 367, 30461.
What is 30461 in binary?
111011011111101 (hexadecimal 76FD, octal 73375).
What is the square root of 30461?
About 174.5308.
Is 30461 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 30461?
30461 is a semiprime: 83 × 367, the product of two primes.