The number 50335
50335 is a composite number with 4 divisors. Its prime factorisation is 5 × 10067. Divisors (4): 1, 5, 10067, 50335.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50335: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 10067, the product of two primes.
- 2
50335 is composite. Its prime factorisation is
- 3
The divisors add up to 60408; without 50335 itself that is 10073, so 50335 is deficient (10073 is less than 50335). Euler's totient φ(50335) = 40264 numbers up to 50335 share no factor with it.
- 4
The digits of 50335 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50335 = 5 \times 10067 \]
50335 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60408 |
| Euler totient φ(n) | 40264 |
| Square | 2533612225 |
| Cube | 127529371345375 |
| Square root | 224.354630 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 88 |
| Scientific notation | 5.0335 × |
50335 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and thirty-five |
| Binary (base 2) | 1100010010011111 |
| Octal (base 8) | 142237 |
| Hexadecimal (base 16) | C49F |
| Base 3 | 2120001021 |
| As time | 50335 seconds = 13 h 58 min 55 s |
Is 50335 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 (50335 ÷ 5 = 10067) | 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 5) | 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 | No (remainder 7) | 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 10) | 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 50335 a prime number?
No. 50335 = 5 × 10067, so it is divisible by 5.
What are the factors of 50335?
1, 5, 10067, 50335.
What is 50335 in binary?
1100010010011111 (hexadecimal C49F, octal 142237).
What is the square root of 50335?
About 224.3546.
Is 50335 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50335?
50335 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 10067, the product of two primes.