The number 19481
19481 is a binary palindrome (100110000011001). Its prime factorisation is 7 × × 23. Divisors (12): 1, 7, 11, 23, 77, 121, 161, 253, 847, 1771, 2783, 19481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19481: a binary palindrome (100110000011001); a Harshad number: divisible by its digit sum 23.
- 2
19481 is composite. Its prime factorisation is
- 3
The divisors add up to 25536; without 19481 itself that is 6055, so 19481 is deficient (6055 is less than 19481). Euler's totient φ(19481) = 14520 numbers up to 19481 share no factor with it.
- 4
The digits of 19481 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 198 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19481 = 7 \times 11^{2} \times 23 \]19481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 25536 |
| Euler totient φ(n) | 14520 |
| Square | 379509361 |
| Cube | 7393221861641 |
| Square root | 139.574353 (= 11√161) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 198 |
| Scientific notation | 1.9481 × |
19481 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand four hundred and eighty-one |
| Binary (base 2) | 100110000011001 |
| Octal (base 8) | 46031 |
| Hexadecimal (base 16) | 4C19 |
| Base 3 | 222201112 |
| As time | 19481 seconds = 5 h 24 min 41 s |
Is 19481 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 | Yes (19481 ÷ 7 = 2783) | 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 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 | Yes (19481 ÷ 11 = 1771) | 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 19481 a prime number?
No. 19481 = 7 × × 23, so it is divisible by 7.
What are the factors of 19481?
1, 7, 11, 23, 77, 121, 161, 253, 847, 1771, 2783, 19481.
What is 19481 in binary?
100110000011001 (hexadecimal 4C19, octal 46031).
What is the square root of 19481?
About 139.5744, exactly 11√161.
Is 19481 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 19481?
19481 is a binary palindrome (100110000011001); a Harshad number: divisible by its digit sum 23.