The number 50336
50336 is a composite number with 36 divisors. Its prime factorisation is × × 13. Divisors (36): 1, 2, 4, 8, 11, 13, 16, 22, 26, 32, 44, 52, 88, 104, 121, 143 … 50336.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50336: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50336 is composite. Its prime factorisation is
- 3
The divisors add up to 117306; without 50336 itself that is 66970, so 50336 is abundant (66970 is more than 50336). Euler's totient φ(50336) = 21120 numbers up to 50336 share no factor with it.
- 4
The digits of 50336 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50336 = 2^{5} \times 11^{2} \times 13 \]50336 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 117306 |
| Euler totient φ(n) | 21120 |
| Square | 2533712896 |
| Cube | 127536972333056 |
| Square root | 224.356859 (= 44√26) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0336 × |
50336 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and thirty-six |
| Binary (base 2) | 1100010010100000 |
| Octal (base 8) | 142240 |
| Hexadecimal (base 16) | C4A0 |
| Base 3 | 2120001022 |
| As time | 50336 seconds = 13 h 58 min 56 s |
Is 50336 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50336 ÷ 2 = 25168) | 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 (50336 ÷ 4 = 12584) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 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 | Yes (50336 ÷ 8 = 6292) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (50336 ÷ 11 = 4576) | 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 50336 a prime number?
No. 50336 = × × 13, so it is divisible by 2.
What are the factors of 50336?
1, 2, 4, 8, 11, 13, 16, 22, 26, 32, 44, 52, 88, 104, 121, 143, 176, 208, 242, 286, 352, 416, 484, 572, 968, 1144, 1573, 1936, 2288, 3146, 3872, 4576, 6292, 12584, 25168, 50336.
What is 50336 in binary?
1100010010100000 (hexadecimal C4A0, octal 142240).
What is the square root of 50336?
About 224.3569, exactly 44√26.
Is 50336 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 50336?
50336 is a happy number: repeatedly adding the squares of its digits reaches 1.