The number 50064
50064 is a composite number with 40 divisors. Its prime factorisation is × 3 × 7 × 149. Divisors (40): 1, 2, 3, 4, 6, 7, 8, 12, 14, 16, 21, 24, 28, 42, 48, 56 … 50064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50064 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50064 is composite. Its prime factorisation is
- 3
The divisors add up to 148800; without 50064 itself that is 98736, so 50064 is abundant (98736 is more than 50064). Euler's totient φ(50064) = 14208 numbers up to 50064 share no factor with it.
- 4
The digits of 50064 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
\[ 50064 = 2^{4} \times 3 \times 7 \times 149 \]50064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 148800 |
| Euler totient φ(n) | 14208 |
| Square | 2506404096 |
| Cube | 125480614662144 |
| Square root | 223.749860 (= 4√3129) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.0064 × |
50064 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and sixty-four |
| Binary (base 2) | 1100001110010000 |
| Octal (base 8) | 141620 |
| Hexadecimal (base 16) | C390 |
| Base 3 | 2112200020 |
| As time | 50064 seconds = 13 h 54 min 24 s |
Is 50064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50064 ÷ 2 = 25032) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50064 ÷ 3 = 16688) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50064 ÷ 4 = 12516) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50064 ÷ 6 = 8344) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (50064 ÷ 7 = 7152) | 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 | Yes (50064 ÷ 8 = 6258) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (50064 ÷ 12 = 4172) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50064 a prime number?
No. 50064 = × 3 × 7 × 149, so it is divisible by 2.
What are the factors of 50064?
1, 2, 3, 4, 6, 7, 8, 12, 14, 16, 21, 24, 28, 42, 48, 56, 84, 112, 149, 168, 298, 336, 447, 596, 894, 1043, 1192, 1788, 2086, 2384, 3129, 3576, 4172, 6258, 7152, 8344, 12516, 16688, 25032, 50064.
What is 50064 in binary?
1100001110010000 (hexadecimal C390, octal 141620).
What is the square root of 50064?
About 223.7499, exactly 4√3129.
Is 50064 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50064?
It is a composite number with 40 divisors.