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