The number 61509
61509 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 29 × 101. Divisors (16): 1, 3, 7, 21, 29, 87, 101, 203, 303, 609, 707, 2121, 2929, 8787, 20503, 61509.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 61509: a Harshad number: divisible by its digit sum 21.
- 2
61509 is composite. Its prime factorisation is
- 3
The divisors add up to 97920; without 61509 itself that is 36411, so 61509 is deficient (36411 is less than 61509). Euler's totient φ(61509) = 33600 numbers up to 61509 share no factor with it.
- 4
The digits of 61509 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 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61509 = 3 \times 7 \times 29 \times 101 \]
61509 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 97920 |
| Euler totient φ(n) | 33600 |
| Square | 3783357081 |
| Cube | 232710510695229 |
| Square root | 248.010080 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 148 |
| Scientific notation | 6.1509 × |
61509 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand five hundred and nine |
| Binary (base 2) | 1111000001000101 |
| Octal (base 8) | 170105 |
| Hexadecimal (base 16) | F045 |
| Base 3 | 10010101010 |
| As time | 61509 seconds = 17 h 5 min 9 s |
Is 61509 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 (61509 ÷ 3 = 20503) | 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 (61509 ÷ 7 = 8787) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 61509 a prime number?
No. 61509 = 3 × 7 × 29 × 101, so it is divisible by 3.
What are the factors of 61509?
1, 3, 7, 21, 29, 87, 101, 203, 303, 609, 707, 2121, 2929, 8787, 20503, 61509.
What is 61509 in binary?
1111000001000101 (hexadecimal F045, octal 170105).
What is the square root of 61509?
About 248.0101.
Is 61509 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 61509?
61509 is a Harshad number: divisible by its digit sum 21.