The number 51208
51208 is a composite number with 16 divisors. Its prime factorisation is × 37 × 173. Divisors (16): 1, 2, 4, 8, 37, 74, 148, 173, 296, 346, 692, 1384, 6401, 12802, 25604, 51208.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51208: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
51208 is composite. Its prime factorisation is
- 3
The divisors add up to 99180; without 51208 itself that is 47972, so 51208 is deficient (47972 is less than 51208). Euler's totient φ(51208) = 24768 numbers up to 51208 share no factor with it.
- 4
The digits of 51208 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51208 = 2^{3} \times 37 \times 173 \]51208 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 99180 |
| Euler totient φ(n) | 24768 |
| Square | 2622259264 |
| Cube | 134280652390912 |
| Square root | 226.291847 (= 2√12802) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1208 × |
51208 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and eight |
| Binary (base 2) | 1100100000001000 |
| Octal (base 8) | 144010 |
| Hexadecimal (base 16) | C808 |
| Base 3 | 2121020121 |
| As time | 51208 seconds = 14 h 13 min 28 s |
Is 51208 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51208 ÷ 2 = 25604) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (51208 ÷ 4 = 12802) | 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 4) | 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 | Yes (51208 ÷ 8 = 6401) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51208 a prime number?
No. 51208 = × 37 × 173, so it is divisible by 2.
What are the factors of 51208?
1, 2, 4, 8, 37, 74, 148, 173, 296, 346, 692, 1384, 6401, 12802, 25604, 51208.
What is 51208 in binary?
1100100000001000 (hexadecimal C808, octal 144010).
What is the square root of 51208?
About 226.2918, exactly 2√12802.
Is 51208 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 51208?
51208 is a happy number: repeatedly adding the squares of its digits reaches 1.