The number 50031
50031 is a composite number with 16 divisors. Its prime factorisation is × 17 × 109. Divisors (16): 1, 3, 9, 17, 27, 51, 109, 153, 327, 459, 981, 1853, 2943, 5559, 16677, 50031.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50031: a Harshad number: divisible by its digit sum 9.
- 2
50031 is composite. Its prime factorisation is
- 3
The divisors add up to 79200; without 50031 itself that is 29169, so 50031 is deficient (29169 is less than 50031). Euler's totient φ(50031) = 31104 numbers up to 50031 share no factor with it.
- 4
The digits of 50031 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50031 = 3^{3} \times 17 \times 109 \]50031 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 79200 |
| Euler totient φ(n) | 31104 |
| Square | 2503100961 |
| Cube | 125232644179791 |
| Square root | 223.676105 (= 3√5559) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.0031 × |
50031 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and thirty-one |
| Binary (base 2) | 1100001101101111 |
| Octal (base 8) | 141557 |
| Hexadecimal (base 16) | C36F |
| Base 3 | 2112122000 |
| As time | 50031 seconds = 13 h 53 min 51 s |
Is 50031 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 (50031 ÷ 3 = 16677) | 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 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 | No (remainder 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50031 ÷ 9 = 5559) | 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 3) | 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 50031 a prime number?
No. 50031 = × 17 × 109, so it is divisible by 3.
What are the factors of 50031?
1, 3, 9, 17, 27, 51, 109, 153, 327, 459, 981, 1853, 2943, 5559, 16677, 50031.
What is 50031 in binary?
1100001101101111 (hexadecimal C36F, octal 141557).
What is the square root of 50031?
About 223.6761, exactly 3√5559.
Is 50031 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 50031?
50031 is a Harshad number: divisible by its digit sum 9.