The number 30481
30481 is a composite number with 8 divisors. Its prime factorisation is 11 × 17 × 163. Divisors (8): 1, 11, 17, 163, 187, 1793, 2771, 30481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
30481 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
30481 is composite. Its prime factorisation is
- 3
The divisors add up to 35424; without 30481 itself that is 4943, so 30481 is deficient (4943 is less than 30481). Euler's totient φ(30481) = 25920 numbers up to 30481 share no factor with it.
- 4
The digits of 30481 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 178 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30481 = 11 \times 17 \times 163 \]
30481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 35424 |
| Euler totient φ(n) | 25920 |
| Square | 929091361 |
| Cube | 28319633774641 |
| Square root | 174.588087 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 178 |
| Scientific notation | 3.0481 × |
30481 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand four hundred and eighty-one |
| Binary (base 2) | 111011100010001 |
| Octal (base 8) | 73421 |
| Hexadecimal (base 16) | 7711 |
| Base 3 | 1112210221 |
| As time | 30481 seconds = 8 h 28 min 1 s |
Is 30481 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | 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 | Yes (30481 ÷ 11 = 2771) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30481 a prime number?
No. 30481 = 11 × 17 × 163, so it is divisible by 11.
What are the factors of 30481?
1, 11, 17, 163, 187, 1793, 2771, 30481.
What is 30481 in binary?
111011100010001 (hexadecimal 7711, octal 73421).
What is the square root of 30481?
About 174.5881.
Is 30481 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 30481?
It is a composite number with 8 divisors.