The number 50415
50415 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 3361. Divisors (8): 1, 3, 5, 15, 3361, 10083, 16805, 50415.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50415: a Harshad number: divisible by its digit sum 15.
- 2
50415 is composite. Its prime factorisation is
- 3
The divisors add up to 80688; without 50415 itself that is 30273, so 50415 is deficient (30273 is less than 50415). Euler's totient φ(50415) = 26880 numbers up to 50415 share no factor with it.
- 4
The digits of 50415 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50415 = 3 \times 5 \times 3361 \]
50415 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 80688 |
| Euler totient φ(n) | 26880 |
| Square | 2541672225 |
| Cube | 128138405223375 |
| Square root | 224.532848 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 189 |
| Scientific notation | 5.0415 × |
50415 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and fifteen |
| Binary (base 2) | 1100010011101111 |
| Octal (base 8) | 142357 |
| Hexadecimal (base 16) | C4EF |
| Base 3 | 2120011020 |
| As time | 50415 seconds = 14 h 0 min 15 s |
Is 50415 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 | Yes (50415 ÷ 3 = 16805) | 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 | Yes (50415 ÷ 5 = 10083) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50415 a prime number?
No. 50415 = 3 × 5 × 3361, so it is divisible by 3.
What are the factors of 50415?
1, 3, 5, 15, 3361, 10083, 16805, 50415.
What is 50415 in binary?
1100010011101111 (hexadecimal C4EF, octal 142357).
What is the square root of 50415?
About 224.5328.
Is 50415 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50415?
50415 is a Harshad number: divisible by its digit sum 15.