The number 50152
50152 is a composite number with 8 divisors. Its prime factorisation is × 6269. Divisors (8): 1, 2, 4, 8, 6269, 12538, 25076, 50152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50152 is composite. Its prime factorisation is
- 3
The divisors add up to 94050; without 50152 itself that is 43898, so 50152 is deficient (43898 is less than 50152). Euler's totient φ(50152) = 25072 numbers up to 50152 share no factor with it.
- 4
The digits of 50152 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50152 = 2^{3} \times 6269 \]50152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 94050 |
| Euler totient φ(n) | 25072 |
| Square | 2515223104 |
| Cube | 126143469111808 |
| Square root | 223.946422 (= 2√12538) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0152 × |
50152 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand one hundred and fifty-two |
| Binary (base 2) | 1100001111101000 |
| Octal (base 8) | 141750 |
| Hexadecimal (base 16) | C3E8 |
| Base 3 | 2112210111 |
| As time | 50152 seconds = 13 h 55 min 52 s |
Is 50152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50152 ÷ 2 = 25076) | 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 | Yes (50152 ÷ 4 = 12538) | 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 4) | 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 | Yes (50152 ÷ 8 = 6269) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50152 a prime number?
No. 50152 = × 6269, so it is divisible by 2.
What are the factors of 50152?
1, 2, 4, 8, 6269, 12538, 25076, 50152.
What is 50152 in binary?
1100001111101000 (hexadecimal C3E8, octal 141750).
What is the square root of 50152?
About 223.9464, exactly 2√12538.
Is 50152 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 50152?
It is a composite number with 8 divisors.