The number 50331
50331 is a composite number with 8 divisors. Its prime factorisation is 3 × 19 × 883. Divisors (8): 1, 3, 19, 57, 883, 2649, 16777, 50331.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50331: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50331 is composite. Its prime factorisation is
- 3
The divisors add up to 70720; without 50331 itself that is 20389, so 50331 is deficient (20389 is less than 50331). Euler's totient φ(50331) = 31752 numbers up to 50331 share no factor with it.
- 4
The digits of 50331 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50331 = 3 \times 19 \times 883 \]
50331 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 70720 |
| Euler totient φ(n) | 31752 |
| Square | 2533209561 |
| Cube | 127498970414691 |
| Square root | 224.345715 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.0331 × |
50331 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and thirty-one |
| Binary (base 2) | 1100010010011011 |
| Octal (base 8) | 142233 |
| Hexadecimal (base 16) | C49B |
| Base 3 | 2120001010 |
| As time | 50331 seconds = 13 h 58 min 51 s |
Is 50331 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 (50331 ÷ 3 = 16777) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50331 a prime number?
No. 50331 = 3 × 19 × 883, so it is divisible by 3.
What are the factors of 50331?
1, 3, 19, 57, 883, 2649, 16777, 50331.
What is 50331 in binary?
1100010010011011 (hexadecimal C49B, octal 142233).
What is the square root of 50331?
About 224.3457.
Is 50331 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 50331?
50331 is a happy number: repeatedly adding the squares of its digits reaches 1.