The number 9481
9481 is a composite number with 4 divisors. Its prime factorisation is 19 × 499. Divisors (4): 1, 19, 499, 9481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9481: a semiprime: 19 × 499, the product of two primes.
- 2
9481 is composite. Its prime factorisation is
- 3
The divisors add up to 10000; without 9481 itself that is 519, so 9481 is deficient (519 is less than 9481). Euler's totient φ(9481) = 8964 numbers up to 9481 share no factor with it.
- 4
The digits of 9481 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9481 = 19 \times 499 \]
9481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 10000 |
| Euler totient φ(n) | 8964 |
| Square | 89889361 |
| Cube | 852241031641 |
| Square root | 97.370427 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 153 |
| Scientific notation | 9.481 × |
9481 in other forms
| Form | Value |
|---|---|
| In words | nine thousand four hundred and eighty-one |
| Binary (base 2) | 10010100001001 |
| Octal (base 8) | 22411 |
| Hexadecimal (base 16) | 2509 |
| Base 3 | 111000011 |
| As time | 9481 seconds = 2 h 38 min 1 s |
Is 9481 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 4) | 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 10) | 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 9481 a prime number?
No. 9481 = 19 × 499, so it is divisible by 19.
What are the factors of 9481?
1, 19, 499, 9481.
What is 9481 in binary?
10010100001001 (hexadecimal 2509, octal 22411).
What is the square root of 9481?
About 97.3704.
Is 9481 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 9481?
9481 is a semiprime: 19 × 499, the product of two primes.