The number 19461
19461 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 499. Divisors (8): 1, 3, 13, 39, 499, 1497, 6487, 19461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19461 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19461 is composite. Its prime factorisation is
- 3
The divisors add up to 28000; without 19461 itself that is 8539, so 19461 is deficient (8539 is less than 19461). Euler's totient φ(19461) = 11952 numbers up to 19461 share no factor with it.
- 4
The digits of 19461 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 48 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19461 = 3 \times 13 \times 499 \]
19461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 28000 |
| Euler totient φ(n) | 11952 |
| Square | 378730521 |
| Cube | 7370474669181 |
| Square root | 139.502688 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 48 |
| Scientific notation | 1.9461 × |
19461 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand four hundred and sixty-one |
| Binary (base 2) | 100110000000101 |
| Octal (base 8) | 46005 |
| Hexadecimal (base 16) | 4C05 |
| Base 3 | 222200210 |
| As time | 19461 seconds = 5 h 24 min 21 s |
Is 19461 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 (19461 ÷ 3 = 6487) | 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 1) | 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 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19461 a prime number?
No. 19461 = 3 × 13 × 499, so it is divisible by 3.
What are the factors of 19461?
1, 3, 13, 39, 499, 1497, 6487, 19461.
What is 19461 in binary?
100110000000101 (hexadecimal 4C05, octal 46005).
What is the square root of 19461?
About 139.5027.
Is 19461 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 19461?
It is a composite number with 8 divisors.