The number 50297
50297 is a composite number with 8 divisors. Its prime factorisation is 13 × 53 × 73. Divisors (8): 1, 13, 53, 73, 689, 949, 3869, 50297.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50297 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50297 is composite. Its prime factorisation is
- 3
The divisors add up to 55944; without 50297 itself that is 5647, so 50297 is deficient (5647 is less than 50297). Euler's totient φ(50297) = 44928 numbers up to 50297 share no factor with it.
- 4
The digits of 50297 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50297 = 13 \times 53 \times 73 \]
50297 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 55944 |
| Euler totient φ(n) | 44928 |
| Square | 2529788209 |
| Cube | 127240757548073 |
| Square root | 224.269927 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0297 × |
50297 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and ninety-seven |
| Binary (base 2) | 1100010001111001 |
| Octal (base 8) | 142171 |
| Hexadecimal (base 16) | C479 |
| Base 3 | 2112222212 |
| As time | 50297 seconds = 13 h 58 min 17 s |
Is 50297 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 2) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50297 a prime number?
No. 50297 = 13 × 53 × 73, so it is divisible by 13.
What are the factors of 50297?
1, 13, 53, 73, 689, 949, 3869, 50297.
What is 50297 in binary?
1100010001111001 (hexadecimal C479, octal 142171).
What is the square root of 50297?
About 224.2699.
Is 50297 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 50297?
It is a composite number with 8 divisors.