The number 50271
50271 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 1289. Divisors (8): 1, 3, 13, 39, 1289, 3867, 16757, 50271.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50271: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50271 is composite. Its prime factorisation is
- 3
The divisors add up to 72240; without 50271 itself that is 21969, so 50271 is deficient (21969 is less than 50271). Euler's totient φ(50271) = 30912 numbers up to 50271 share no factor with it.
- 4
The digits of 50271 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 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50271 = 3 \times 13 \times 1289 \]
50271 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 72240 |
| Euler totient φ(n) | 30912 |
| Square | 2527173441 |
| Cube | 127043536052511 |
| Square root | 224.211953 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.0271 × |
50271 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and seventy-one |
| Binary (base 2) | 1100010001011111 |
| Octal (base 8) | 142137 |
| Hexadecimal (base 16) | C45F |
| Base 3 | 2112221220 |
| As time | 50271 seconds = 13 h 57 min 51 s |
Is 50271 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 (50271 ÷ 3 = 16757) | 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 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 7) | 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 1) | 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 50271 a prime number?
No. 50271 = 3 × 13 × 1289, so it is divisible by 3.
What are the factors of 50271?
1, 3, 13, 39, 1289, 3867, 16757, 50271.
What is 50271 in binary?
1100010001011111 (hexadecimal C45F, octal 142137).
What is the square root of 50271?
About 224.2120.
Is 50271 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50271?
50271 is a happy number: repeatedly adding the squares of its digits reaches 1.