The number 50151
50151 is a composite number with 8 divisors. Its prime factorisation is 3 × 73 × 229. Divisors (8): 1, 3, 73, 219, 229, 687, 16717, 50151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50151 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50151 is composite. Its prime factorisation is
- 3
The divisors add up to 68080; without 50151 itself that is 17929, so 50151 is deficient (17929 is less than 50151). Euler's totient φ(50151) = 32832 numbers up to 50151 share no factor with it.
- 4
The digits of 50151 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50151 = 3 \times 73 \times 229 \]
50151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 68080 |
| Euler totient φ(n) | 32832 |
| Square | 2515122801 |
| Cube | 126135923592951 |
| Square root | 223.944189 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0151 × |
50151 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand one hundred and fifty-one |
| Binary (base 2) | 1100001111100111 |
| Octal (base 8) | 141747 |
| Hexadecimal (base 16) | C3E7 |
| Base 3 | 2112210110 |
| As time | 50151 seconds = 13 h 55 min 51 s |
Is 50151 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 (50151 ÷ 3 = 16717) | 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 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 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 50151 a prime number?
No. 50151 = 3 × 73 × 229, so it is divisible by 3.
What are the factors of 50151?
1, 3, 73, 219, 229, 687, 16717, 50151.
What is 50151 in binary?
1100001111100111 (hexadecimal C3E7, octal 141747).
What is the square root of 50151?
About 223.9442.
Is 50151 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 50151?
It is a composite number with 8 divisors.