The number 50467
50467 is a composite number with 4 divisors. Its prime factorisation is 109 × 463. Divisors (4): 1, 109, 463, 50467.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50467: a semiprime: 109 × 463, the product of two primes.
- 2
50467 is composite. Its prime factorisation is
- 3
The divisors add up to 51040; without 50467 itself that is 573, so 50467 is deficient (573 is less than 50467). Euler's totient φ(50467) = 49896 numbers up to 50467 share no factor with it.
- 4
The digits of 50467 add up to 22, 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
\[ 50467 = 109 \times 463 \]
50467 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51040 |
| Euler totient φ(n) | 49896 |
| Square | 2546918089 |
| Cube | 128535315197563 |
| Square root | 224.648615 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0467 × |
50467 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and sixty-seven |
| Binary (base 2) | 1100010100100011 |
| Octal (base 8) | 142443 |
| Hexadecimal (base 16) | C523 |
| Base 3 | 2120020011 |
| As time | 50467 seconds = 14 h 1 min 7 s |
Is 50467 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 2) | 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 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 | No (remainder 3) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 50467 a prime number?
No. 50467 = 109 × 463, so it is divisible by 109.
What are the factors of 50467?
1, 109, 463, 50467.
What is 50467 in binary?
1100010100100011 (hexadecimal C523, octal 142443).
What is the square root of 50467?
About 224.6486.
Is 50467 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 50467?
50467 is a semiprime: 109 × 463, the product of two primes.