The number 50372
50372 is a composite number with 18 divisors. Its prime factorisation is × × 257. Divisors (18): 1, 2, 4, 7, 14, 28, 49, 98, 196, 257, 514, 1028, 1799, 3598, 7196, 12593 … 50372.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50372 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50372 is composite. Its prime factorisation is
- 3
The divisors add up to 102942; without 50372 itself that is 52570, so 50372 is abundant (52570 is more than 50372). Euler's totient φ(50372) = 21504 numbers up to 50372 share no factor with it.
- 4
The digits of 50372 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50372 = 2^{2} \times 7^{2} \times 257 \]50372 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 102942 |
| Euler totient φ(n) | 21504 |
| Square | 2537338384 |
| Cube | 127810809078848 |
| Square root | 224.437074 (= 14√257) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0372 × |
50372 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and seventy-two |
| Binary (base 2) | 1100010011000100 |
| Octal (base 8) | 142304 |
| Hexadecimal (base 16) | C4C4 |
| Base 3 | 2120002122 |
| As time | 50372 seconds = 13 h 59 min 32 s |
Is 50372 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50372 ÷ 2 = 25186) | 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 | Yes (50372 ÷ 4 = 12593) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (50372 ÷ 7 = 7196) | 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 4) | 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 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50372 a prime number?
No. 50372 = × × 257, so it is divisible by 2.
What are the factors of 50372?
1, 2, 4, 7, 14, 28, 49, 98, 196, 257, 514, 1028, 1799, 3598, 7196, 12593, 25186, 50372.
What is 50372 in binary?
1100010011000100 (hexadecimal C4C4, octal 142304).
What is the square root of 50372?
About 224.4371, exactly 14√257.
Is 50372 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 50372?
It is a composite number with 18 divisors.