The number 16050
16050 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 107. Divisors (24): 1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 107, 150, 214, 321, 535 … 16050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16050 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16050 is composite. Its prime factorisation is
- 3
The divisors add up to 40176; without 16050 itself that is 24126, so 16050 is abundant (24126 is more than 16050). Euler's totient φ(16050) = 4240 numbers up to 16050 share no factor with it.
- 4
The digits of 16050 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16050 = 2 \times 3 \times 5^{2} \times 107 \]16050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 40176 |
| Euler totient φ(n) | 4240 |
| Square | 257602500 |
| Cube | 4134520125000 |
| Square root | 126.688595 (= 5√642) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.605 × |
16050 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand and fifty |
| Binary (base 2) | 11111010110010 |
| Octal (base 8) | 37262 |
| Hexadecimal (base 16) | 3EB2 |
| Base 3 | 211000110 |
| As time | 16050 seconds = 4 h 27 min 30 s |
Is 16050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16050 ÷ 2 = 8025) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (16050 ÷ 3 = 5350) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (16050 ÷ 5 = 3210) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (16050 ÷ 6 = 2675) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (16050 ÷ 10 = 1605) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16050 a prime number?
No. 16050 = 2 × 3 × × 107, so it is divisible by 2.
What are the factors of 16050?
1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 107, 150, 214, 321, 535, 642, 1070, 1605, 2675, 3210, 5350, 8025, 16050.
What is 16050 in binary?
11111010110010 (hexadecimal 3EB2, octal 37262).
What is the square root of 16050?
About 126.6886, exactly 5√642.
Is 16050 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 16050?
It is a composite number with 24 divisors.