The number 51309
51309 is a composite number with 6 divisors. Its prime factorisation is × 5701. Divisors (6): 1, 3, 9, 5701, 17103, 51309.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51309 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51309 is composite. Its prime factorisation is
- 3
The divisors add up to 74126; without 51309 itself that is 22817, so 51309 is deficient (22817 is less than 51309). Euler's totient φ(51309) = 34200 numbers up to 51309 share no factor with it.
- 4
The digits of 51309 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51309 = 3^{2} \times 5701 \]51309 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 74126 |
| Euler totient φ(n) | 34200 |
| Square | 2632613481 |
| Cube | 135076765096629 |
| Square root | 226.514900 (= 3√5701) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1309 × |
51309 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and nine |
| Binary (base 2) | 1100100001101101 |
| Octal (base 8) | 144155 |
| Hexadecimal (base 16) | C86D |
| Base 3 | 2121101100 |
| As time | 51309 seconds = 14 h 15 min 9 s |
Is 51309 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 (51309 ÷ 3 = 17103) | 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 | No (remainder 6) | 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 | Yes (51309 ÷ 9 = 5701) | 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 5) | 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 51309 a prime number?
No. 51309 = × 5701, so it is divisible by 3.
What are the factors of 51309?
1, 3, 9, 5701, 17103, 51309.
What is 51309 in binary?
1100100001101101 (hexadecimal C86D, octal 144155).
What is the square root of 51309?
About 226.5149, exactly 3√5701.
Is 51309 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 51309?
It is a composite number with 6 divisors.