The number 50035
50035 is a composite number with 4 divisors. Its prime factorisation is 5 × 10007. Divisors (4): 1, 5, 10007, 50035.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50035: a semiprime: 5 × 10007, the product of two primes.
- 2
50035 is composite. Its prime factorisation is
- 3
The divisors add up to 60048; without 50035 itself that is 10013, so 50035 is deficient (10013 is less than 50035). Euler's totient φ(50035) = 40024 numbers up to 50035 share no factor with it.
- 4
The digits of 50035 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50035 = 5 \times 10007 \]
50035 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60048 |
| Euler totient φ(n) | 40024 |
| Square | 2503501225 |
| Cube | 125262683792875 |
| Square root | 223.685046 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0035 × |
50035 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and thirty-five |
| Binary (base 2) | 1100001101110011 |
| Octal (base 8) | 141563 |
| Hexadecimal (base 16) | C373 |
| Base 3 | 2112122011 |
| As time | 50035 seconds = 13 h 53 min 55 s |
Is 50035 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 | Yes (50035 ÷ 5 = 10007) | 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 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 | No (remainder 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 50035 a prime number?
No. 50035 = 5 × 10007, so it is divisible by 5.
What are the factors of 50035?
1, 5, 10007, 50035.
What is 50035 in binary?
1100001101110011 (hexadecimal C373, octal 141563).
What is the square root of 50035?
About 223.6850.
Is 50035 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 50035?
50035 is a semiprime: 5 × 10007, the product of two primes.