The number 50269
50269 is a composite number with 4 divisors. Its prime factorisation is 17 × 2957. Divisors (4): 1, 17, 2957, 50269.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50269: a semiprime: 17 × 2957, the product of two primes.
- 2
50269 is composite. Its prime factorisation is
- 3
The divisors add up to 53244; without 50269 itself that is 2975, so 50269 is deficient (2975 is less than 50269). Euler's totient φ(50269) = 47296 numbers up to 50269 share no factor with it.
- 4
The digits of 50269 add up to 22, 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
\[ 50269 = 17 \times 2957 \]
50269 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53244 |
| Euler totient φ(n) | 47296 |
| Square | 2526972361 |
| Cube | 127028373615109 |
| Square root | 224.207493 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0269 × |
50269 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and sixty-nine |
| Binary (base 2) | 1100010001011101 |
| Octal (base 8) | 142135 |
| Hexadecimal (base 16) | C45D |
| Base 3 | 2112221211 |
| As time | 50269 seconds = 13 h 57 min 49 s |
Is 50269 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 1) | 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 5) | 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 9) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50269 a prime number?
No. 50269 = 17 × 2957, so it is divisible by 17.
What are the factors of 50269?
1, 17, 2957, 50269.
What is 50269 in binary?
1100010001011101 (hexadecimal C45D, octal 142135).
What is the square root of 50269?
About 224.2075.
Is 50269 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 50269?
50269 is a semiprime: 17 × 2957, the product of two primes.