The number 19509
19509 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 929. Divisors (8): 1, 3, 7, 21, 929, 2787, 6503, 19509.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19509: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
19509 is composite. Its prime factorisation is
- 3
The divisors add up to 29760; without 19509 itself that is 10251, so 19509 is deficient (10251 is less than 19509). Euler's totient φ(19509) = 11136 numbers up to 19509 share no factor with it.
- 4
The digits of 19509 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 136 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19509 = 3 \times 7 \times 929 \]
19509 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 29760 |
| Euler totient φ(n) | 11136 |
| Square | 380601081 |
| Cube | 7425146489229 |
| Square root | 139.674622 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 136 |
| Scientific notation | 1.9509 × |
19509 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand five hundred and nine |
| Binary (base 2) | 100110000110101 |
| Octal (base 8) | 46065 |
| Hexadecimal (base 16) | 4C35 |
| Base 3 | 222202120 |
| As time | 19509 seconds = 5 h 25 min 9 s |
Is 19509 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 (19509 ÷ 3 = 6503) | 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 4) | 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 | Yes (19509 ÷ 7 = 2787) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 19509 a prime number?
No. 19509 = 3 × 7 × 929, so it is divisible by 3.
What are the factors of 19509?
1, 3, 7, 21, 929, 2787, 6503, 19509.
What is 19509 in binary?
100110000110101 (hexadecimal 4C35, octal 46065).
What is the square root of 19509?
About 139.6746.
Is 19509 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 19509?
19509 is a happy number: repeatedly adding the squares of its digits reaches 1.