The number 50431
50431 is a composite number with 8 divisors. Its prime factorisation is 29 × 37 × 47. Divisors (8): 1, 29, 37, 47, 1073, 1363, 1739, 50431.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50431 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50431 is composite. Its prime factorisation is
- 3
The divisors add up to 54720; without 50431 itself that is 4289, so 50431 is deficient (4289 is less than 50431). Euler's totient φ(50431) = 46368 numbers up to 50431 share no factor with it.
- 4
The digits of 50431 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 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50431 = 29 \times 37 \times 47 \]
50431 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 54720 |
| Euler totient φ(n) | 46368 |
| Square | 2543285761 |
| Cube | 128260444212991 |
| Square root | 224.568475 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 189 |
| Scientific notation | 5.0431 × |
50431 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and thirty-one |
| Binary (base 2) | 1100010011111111 |
| Octal (base 8) | 142377 |
| Hexadecimal (base 16) | C4FF |
| Base 3 | 2120011211 |
| As time | 50431 seconds = 14 h 0 min 31 s |
Is 50431 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 3) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50431 a prime number?
No. 50431 = 29 × 37 × 47, so it is divisible by 29.
What are the factors of 50431?
1, 29, 37, 47, 1073, 1363, 1739, 50431.
What is 50431 in binary?
1100010011111111 (hexadecimal C4FF, octal 142377).
What is the square root of 50431?
About 224.5685.
Is 50431 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 50431?
It is a composite number with 8 divisors.