The number 50360
50360 is a composite number with 16 divisors. Its prime factorisation is × 5 × 1259. Divisors (16): 1, 2, 4, 5, 8, 10, 20, 40, 1259, 2518, 5036, 6295, 10072, 12590, 25180, 50360.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50360: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50360 is composite. Its prime factorisation is
- 3
The divisors add up to 113400; without 50360 itself that is 63040, so 50360 is abundant (63040 is more than 50360). Euler's totient φ(50360) = 20128 numbers up to 50360 share no factor with it.
- 4
The digits of 50360 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50360 = 2^{3} \times 5 \times 1259 \]50360 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 113400 |
| Euler totient φ(n) | 20128 |
| Square | 2536129600 |
| Cube | 127719486656000 |
| Square root | 224.410338 (= 2√12590) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.036 × |
50360 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and sixty |
| Binary (base 2) | 1100010010111000 |
| Octal (base 8) | 142270 |
| Hexadecimal (base 16) | C4B8 |
| Base 3 | 2120002012 |
| As time | 50360 seconds = 13 h 59 min 20 s |
Is 50360 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50360 ÷ 2 = 25180) | 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 (50360 ÷ 4 = 12590) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50360 ÷ 5 = 10072) | 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 2) | 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 (50360 ÷ 8 = 6295) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (50360 ÷ 10 = 5036) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 50360 a prime number?
No. 50360 = × 5 × 1259, so it is divisible by 2.
What are the factors of 50360?
1, 2, 4, 5, 8, 10, 20, 40, 1259, 2518, 5036, 6295, 10072, 12590, 25180, 50360.
What is 50360 in binary?
1100010010111000 (hexadecimal C4B8, octal 142270).
What is the square root of 50360?
About 224.4103, exactly 2√12590.
Is 50360 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 50360?
50360 is a happy number: repeatedly adding the squares of its digits reaches 1.