The number 50059
50059 is a composite number with 4 divisors. Its prime factorisation is 113 × 443. Divisors (4): 1, 113, 443, 50059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50059: a semiprime: 113 × 443, the product of two primes.
- 2
50059 is composite. Its prime factorisation is
- 3
The divisors add up to 50616; without 50059 itself that is 557, so 50059 is deficient (557 is less than 50059). Euler's totient φ(50059) = 49504 numbers up to 50059 share no factor with it.
- 4
The digits of 50059 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50059 = 113 \times 443 \]
50059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50616 |
| Euler totient φ(n) | 49504 |
| Square | 2505903481 |
| Cube | 125443022355379 |
| Square root | 223.738687 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 88 |
| Scientific notation | 5.0059 × |
50059 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and fifty-nine |
| Binary (base 2) | 1100001110001011 |
| Octal (base 8) | 141613 |
| Hexadecimal (base 16) | C38B |
| Base 3 | 2112200001 |
| As time | 50059 seconds = 13 h 54 min 19 s |
Is 50059 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 | No (remainder 1) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50059 a prime number?
No. 50059 = 113 × 443, so it is divisible by 113.
What are the factors of 50059?
1, 113, 443, 50059.
What is 50059 in binary?
1100001110001011 (hexadecimal C38B, octal 141613).
What is the square root of 50059?
About 223.7387.
Is 50059 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 50059?
50059 is a semiprime: 113 × 443, the product of two primes.