The number 50149
50149 is a composite number with 8 divisors. Its prime factorisation is 11 × 47 × 97. Divisors (8): 1, 11, 47, 97, 517, 1067, 4559, 50149.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50149 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50149 is composite. Its prime factorisation is
- 3
The divisors add up to 56448; without 50149 itself that is 6299, so 50149 is deficient (6299 is less than 50149). Euler's totient φ(50149) = 44160 numbers up to 50149 share no factor with it.
- 4
The digits of 50149 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50149 = 11 \times 47 \times 97 \]
50149 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 56448 |
| Euler totient φ(n) | 44160 |
| Square | 2514922201 |
| Cube | 126120833457949 |
| Square root | 223.939724 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0149 × |
50149 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand one hundred and forty-nine |
| Binary (base 2) | 1100001111100101 |
| Octal (base 8) | 141745 |
| Hexadecimal (base 16) | C3E5 |
| Base 3 | 2112210101 |
| As time | 50149 seconds = 13 h 55 min 49 s |
Is 50149 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 1) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (50149 ÷ 11 = 4559) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50149 a prime number?
No. 50149 = 11 × 47 × 97, so it is divisible by 11.
What are the factors of 50149?
1, 11, 47, 97, 517, 1067, 4559, 50149.
What is 50149 in binary?
1100001111100101 (hexadecimal C3E5, octal 141745).
What is the square root of 50149?
About 223.9397.
Is 50149 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 50149?
It is a composite number with 8 divisors.