The number 50145
50145 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 3343. Divisors (8): 1, 3, 5, 15, 3343, 10029, 16715, 50145.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50145: a Harshad number: divisible by its digit sum 15.
- 2
50145 is composite. Its prime factorisation is
- 3
The divisors add up to 80256; without 50145 itself that is 30111, so 50145 is deficient (30111 is less than 50145). Euler's totient φ(50145) = 26736 numbers up to 50145 share no factor with it.
- 4
The digits of 50145 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 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50145 = 3 \times 5 \times 3343 \]
50145 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 80256 |
| Euler totient φ(n) | 26736 |
| Square | 2514521025 |
| Cube | 126090656798625 |
| Square root | 223.930793 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.0145 × |
50145 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand one hundred and forty-five |
| Binary (base 2) | 1100001111100001 |
| Octal (base 8) | 141741 |
| Hexadecimal (base 16) | C3E1 |
| Base 3 | 2112210020 |
| As time | 50145 seconds = 13 h 55 min 45 s |
Is 50145 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 (50145 ÷ 3 = 16715) | 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 (50145 ÷ 5 = 10029) | 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 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 1) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50145 a prime number?
No. 50145 = 3 × 5 × 3343, so it is divisible by 3.
What are the factors of 50145?
1, 3, 5, 15, 3343, 10029, 16715, 50145.
What is 50145 in binary?
1100001111100001 (hexadecimal C3E1, octal 141741).
What is the square root of 50145?
About 223.9308.
Is 50145 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50145?
50145 is a Harshad number: divisible by its digit sum 15.