The number 50121
50121 is a composite number with 6 divisors. Its prime factorisation is × 5569. Divisors (6): 1, 3, 9, 5569, 16707, 50121.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50121: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.
- 2
50121 is composite. Its prime factorisation is
- 3
The divisors add up to 72410; without 50121 itself that is 22289, so 50121 is deficient (22289 is less than 50121). Euler's totient φ(50121) = 33408 numbers up to 50121 share no factor with it.
- 4
The digits of 50121 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50121 = 3^{2} \times 5569 \]50121 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 72410 |
| Euler totient φ(n) | 33408 |
| Square | 2512114641 |
| Cube | 125909697921561 |
| Square root | 223.877198 (= 3√5569) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0121 × |
50121 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand one hundred and twenty-one |
| Binary (base 2) | 1100001111001001 |
| Octal (base 8) | 141711 |
| Hexadecimal (base 16) | C3C9 |
| Base 3 | 2112202100 |
| As time | 50121 seconds = 13 h 55 min 21 s |
Is 50121 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 (50121 ÷ 3 = 16707) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50121 ÷ 9 = 5569) | 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 5) | 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 50121 a prime number?
No. 50121 = × 5569, so it is divisible by 3.
What are the factors of 50121?
1, 3, 9, 5569, 16707, 50121.
What is 50121 in binary?
1100001111001001 (hexadecimal C3C9, octal 141711).
What is the square root of 50121?
About 223.8772, exactly 3√5569.
Is 50121 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 50121?
50121 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.