The number 50147
50147 is the 5150th prime number. Its only divisors are 1 and 50147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50147: the 5150th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50147 is prime, so its only factors are 1 and 50147. It is the 5150th prime; the next prime is 50153 and the one before is 50131.
- 3
The divisors add up to 50148; without 50147 itself that is 1, so 50147 is deficient (1 is less than 50147). Euler's totient φ(50147) = 50146 numbers up to 50147 share no factor with it.
- 4
The digits of 50147 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
50147 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 50148 |
| Euler totient φ(n) | 50146 |
| Square | 2514721609 |
| Cube | 126105744526523 |
| Square root | 223.935259 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.0147 × |
50147 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand one hundred and forty-seven |
| Binary (base 2) | 1100001111100011 |
| Octal (base 8) | 141743 |
| Hexadecimal (base 16) | C3E3 |
| Base 3 | 2112210022 |
| As time | 50147 seconds = 13 h 55 min 47 s |
Is 50147 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 8) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50147 a prime number?
Yes. 50147 is divisible only by 1 and itself.
What are the factors of 50147?
1, 50147.
What is 50147 in binary?
1100001111100011 (hexadecimal C3E3, octal 141743).
What is the square root of 50147?
About 223.9353.
Is 50147 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 50147?
50147 is the 5150th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.