The number 50901
50901 is a composite number with 12 divisors. Its prime factorisation is 3 × × 47. Divisors (12): 1, 3, 19, 47, 57, 141, 361, 893, 1083, 2679, 16967, 50901.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50901 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50901 is composite. Its prime factorisation is
- 3
The divisors add up to 73152; without 50901 itself that is 22251, so 50901 is deficient (22251 is less than 50901). Euler's totient φ(50901) = 31464 numbers up to 50901 share no factor with it.
- 4
The digits of 50901 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50901 = 3 \times 19^{2} \times 47 \]50901 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 73152 |
| Euler totient φ(n) | 31464 |
| Square | 2590911801 |
| Cube | 131880001582701 |
| Square root | 225.612500 (= 19√141) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0901 × |
50901 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and one |
| Binary (base 2) | 1100011011010101 |
| Octal (base 8) | 143325 |
| Hexadecimal (base 16) | C6D5 |
| Base 3 | 2120211020 |
| As time | 50901 seconds = 14 h 8 min 21 s |
Is 50901 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 (50901 ÷ 3 = 16967) | 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 1) | 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 4) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50901 a prime number?
No. 50901 = 3 × × 47, so it is divisible by 3.
What are the factors of 50901?
1, 3, 19, 47, 57, 141, 361, 893, 1083, 2679, 16967, 50901.
What is 50901 in binary?
1100011011010101 (hexadecimal C6D5, octal 143325).
What is the square root of 50901?
About 225.6125, exactly 19√141.
Is 50901 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50901?
It is a composite number with 12 divisors.