The number 51308
51308 is a composite number with 12 divisors. Its prime factorisation is × 101 × 127. Divisors (12): 1, 2, 4, 101, 127, 202, 254, 404, 508, 12827, 25654, 51308.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51308 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51308 is composite. Its prime factorisation is
- 3
The divisors add up to 91392; without 51308 itself that is 40084, so 51308 is deficient (40084 is less than 51308). Euler's totient φ(51308) = 25200 numbers up to 51308 share no factor with it.
- 4
The digits of 51308 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51308 = 2^{2} \times 101 \times 127 \]51308 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 91392 |
| Euler totient φ(n) | 25200 |
| Square | 2632510864 |
| Cube | 135068867410112 |
| Square root | 226.512693 (= 2√12827) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1308 × |
51308 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and eight |
| Binary (base 2) | 1100100001101100 |
| Octal (base 8) | 144154 |
| Hexadecimal (base 16) | C86C |
| Base 3 | 2121101022 |
| As time | 51308 seconds = 14 h 15 min 8 s |
Is 51308 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51308 ÷ 2 = 25654) | 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 | Yes (51308 ÷ 4 = 12827) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51308 a prime number?
No. 51308 = × 101 × 127, so it is divisible by 2.
What are the factors of 51308?
1, 2, 4, 101, 127, 202, 254, 404, 508, 12827, 25654, 51308.
What is 51308 in binary?
1100100001101100 (hexadecimal C86C, octal 144154).
What is the square root of 51308?
About 226.5127, exactly 2√12827.
Is 51308 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 51308?
It is a composite number with 12 divisors.