The number 50907
50907 is a composite number with 8 divisors. Its prime factorisation is 3 × 71 × 239. Divisors (8): 1, 3, 71, 213, 239, 717, 16969, 50907.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50907 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50907 is composite. Its prime factorisation is
- 3
The divisors add up to 69120; without 50907 itself that is 18213, so 50907 is deficient (18213 is less than 50907). Euler's totient φ(50907) = 33320 numbers up to 50907 share no factor with it.
- 4
The digits of 50907 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50907 = 3 \times 71 \times 239 \]
50907 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 69120 |
| Euler totient φ(n) | 33320 |
| Square | 2591522649 |
| Cube | 131926643492643 |
| Square root | 225.625796 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 57 |
| Scientific notation | 5.0907 × |
50907 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and seven |
| Binary (base 2) | 1100011011011011 |
| Octal (base 8) | 143333 |
| Hexadecimal (base 16) | C6DB |
| Base 3 | 2120211110 |
| As time | 50907 seconds = 14 h 8 min 27 s |
Is 50907 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 | Yes (50907 ÷ 3 = 16969) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 3) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50907 a prime number?
No. 50907 = 3 × 71 × 239, so it is divisible by 3.
What are the factors of 50907?
1, 3, 71, 213, 239, 717, 16969, 50907.
What is 50907 in binary?
1100011011011011 (hexadecimal C6DB, octal 143333).
What is the square root of 50907?
About 225.6258.
Is 50907 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 50907?
It is a composite number with 8 divisors.