The number 50157
50157 is a composite number with 6 divisors. Its prime factorisation is × 5573. Divisors (6): 1, 3, 9, 5573, 16719, 50157.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50157: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50157 is composite. Its prime factorisation is
- 3
The divisors add up to 72462; without 50157 itself that is 22305, so 50157 is deficient (22305 is less than 50157). Euler's totient φ(50157) = 33432 numbers up to 50157 share no factor with it.
- 4
The digits of 50157 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50157 = 3^{2} \times 5573 \]50157 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 72462 |
| Euler totient φ(n) | 33432 |
| Square | 2515724649 |
| Cube | 126181201219893 |
| Square root | 223.957585 (= 3√5573) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.0157 × |
50157 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand one hundred and fifty-seven |
| Binary (base 2) | 1100001111101101 |
| Octal (base 8) | 141755 |
| Hexadecimal (base 16) | C3ED |
| Base 3 | 2112210200 |
| As time | 50157 seconds = 13 h 55 min 57 s |
Is 50157 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 (50157 ÷ 3 = 16719) | 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 2) | 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 2) | 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 | Yes (50157 ÷ 9 = 5573) | 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 8) | 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 50157 a prime number?
No. 50157 = × 5573, so it is divisible by 3.
What are the factors of 50157?
1, 3, 9, 5573, 16719, 50157.
What is 50157 in binary?
1100001111101101 (hexadecimal C3ED, octal 141755).
What is the square root of 50157?
About 223.9576, exactly 3√5573.
Is 50157 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50157?
50157 is a happy number: repeatedly adding the squares of its digits reaches 1.