The number 50068
50068 is a composite number with 6 divisors. Its prime factorisation is × 12517. Divisors (6): 1, 2, 4, 12517, 25034, 50068.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50068 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50068 is composite. Its prime factorisation is
- 3
The divisors add up to 87626; without 50068 itself that is 37558, so 50068 is deficient (37558 is less than 50068). Euler's totient φ(50068) = 25032 numbers up to 50068 share no factor with it.
- 4
The digits of 50068 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50068 = 2^{2} \times 12517 \]50068 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 87626 |
| Euler totient φ(n) | 25032 |
| Square | 2506804624 |
| Cube | 125510693914432 |
| Square root | 223.758799 (= 2√12517) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.0068 × |
50068 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and sixty-eight |
| Binary (base 2) | 1100001110010100 |
| Octal (base 8) | 141624 |
| Hexadecimal (base 16) | C394 |
| Base 3 | 2112200101 |
| As time | 50068 seconds = 13 h 54 min 28 s |
Is 50068 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50068 ÷ 2 = 25034) | 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 | Yes (50068 ÷ 4 = 12517) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50068 a prime number?
No. 50068 = × 12517, so it is divisible by 2.
What are the factors of 50068?
1, 2, 4, 12517, 25034, 50068.
What is 50068 in binary?
1100001110010100 (hexadecimal C394, octal 141624).
What is the square root of 50068?
About 223.7588, exactly 2√12517.
Is 50068 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 50068?
It is a composite number with 6 divisors.