The number 19505
19505 is a composite number with 8 divisors. Its prime factorisation is 5 × 47 × 83. Divisors (8): 1, 5, 47, 83, 235, 415, 3901, 19505.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19505 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19505 is composite. Its prime factorisation is
- 3
The divisors add up to 24192; without 19505 itself that is 4687, so 19505 is deficient (4687 is less than 19505). Euler's totient φ(19505) = 15088 numbers up to 19505 share no factor with it.
- 4
The digits of 19505 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 123 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19505 = 5 \times 47 \times 83 \]
19505 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 24192 |
| Euler totient φ(n) | 15088 |
| Square | 380445025 |
| Cube | 7420580212625 |
| Square root | 139.660302 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 123 |
| Scientific notation | 1.9505 × |
19505 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand five hundred and five |
| Binary (base 2) | 100110000110001 |
| Octal (base 8) | 46061 |
| Hexadecimal (base 16) | 4C31 |
| Base 3 | 222202102 |
| As time | 19505 seconds = 5 h 25 min 5 s |
Is 19505 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 | Yes (19505 ÷ 5 = 3901) | 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 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 19505 a prime number?
No. 19505 = 5 × 47 × 83, so it is divisible by 5.
What are the factors of 19505?
1, 5, 47, 83, 235, 415, 3901, 19505.
What is 19505 in binary?
100110000110001 (hexadecimal 4C31, octal 46061).
What is the square root of 19505?
About 139.6603.
Is 19505 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 19505?
It is a composite number with 8 divisors.