The number 50465
50465 is a composite number with 4 divisors. Its prime factorisation is 5 × 10093. Divisors (4): 1, 5, 10093, 50465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50465: a semiprime: 5 × 10093, the product of two primes.
- 2
50465 is composite. Its prime factorisation is
- 3
The divisors add up to 60564; without 50465 itself that is 10099, so 50465 is deficient (10099 is less than 50465). Euler's totient φ(50465) = 40368 numbers up to 50465 share no factor with it.
- 4
The digits of 50465 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50465 = 5 \times 10093 \]
50465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60564 |
| Euler totient φ(n) | 40368 |
| Square | 2546716225 |
| Cube | 128520034294625 |
| Square root | 224.644163 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0465 × |
50465 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and sixty-five |
| Binary (base 2) | 1100010100100001 |
| Octal (base 8) | 142441 |
| Hexadecimal (base 16) | C521 |
| Base 3 | 2120020002 |
| As time | 50465 seconds = 14 h 1 min 5 s |
Is 50465 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 2) | 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 | Yes (50465 ÷ 5 = 10093) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50465 a prime number?
No. 50465 = 5 × 10093, so it is divisible by 5.
What are the factors of 50465?
1, 5, 10093, 50465.
What is 50465 in binary?
1100010100100001 (hexadecimal C521, octal 142441).
What is the square root of 50465?
About 224.6442.
Is 50465 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 50465?
50465 is a semiprime: 5 × 10093, the product of two primes.