The number 50067
50067 is a composite number with 6 divisors. Its prime factorisation is × 5563. Divisors (6): 1, 3, 9, 5563, 16689, 50067.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50067 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50067 is composite. Its prime factorisation is
- 3
The divisors add up to 72332; without 50067 itself that is 22265, so 50067 is deficient (22265 is less than 50067). Euler's totient φ(50067) = 33372 numbers up to 50067 share no factor with it.
- 4
The digits of 50067 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50067 = 3^{2} \times 5563 \]50067 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 72332 |
| Euler totient φ(n) | 33372 |
| Square | 2506704489 |
| Cube | 125503173650763 |
| Square root | 223.756564 (= 3√5563) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0067 × |
50067 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and sixty-seven |
| Binary (base 2) | 1100001110010011 |
| Octal (base 8) | 141623 |
| Hexadecimal (base 16) | C393 |
| Base 3 | 2112200100 |
| As time | 50067 seconds = 13 h 54 min 27 s |
Is 50067 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 (50067 ÷ 3 = 16689) | 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 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50067 ÷ 9 = 5563) | 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 6) | 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 50067 a prime number?
No. 50067 = × 5563, so it is divisible by 3.
What are the factors of 50067?
1, 3, 9, 5563, 16689, 50067.
What is 50067 in binary?
1100001110010011 (hexadecimal C393, octal 141623).
What is the square root of 50067?
About 223.7566, exactly 3√5563.
Is 50067 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50067?
It is a composite number with 6 divisors.