The number 16053
16053 is a composite number with 4 divisors. Its prime factorisation is 3 × 5351. Divisors (4): 1, 3, 5351, 16053.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16053: a semiprime: 3 × 5351, the product of two primes.
- 2
16053 is composite. Its prime factorisation is
- 3
The divisors add up to 21408; without 16053 itself that is 5355, so 16053 is deficient (5355 is less than 16053). Euler's totient φ(16053) = 10700 numbers up to 16053 share no factor with it.
- 4
The digits of 16053 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 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16053 = 3 \times 5351 \]
16053 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 21408 |
| Euler totient φ(n) | 10700 |
| Square | 257698809 |
| Cube | 4136838980877 |
| Square root | 126.700434 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.6053 × |
16053 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand and fifty-three |
| Binary (base 2) | 11111010110101 |
| Octal (base 8) | 37265 |
| Hexadecimal (base 16) | 3EB5 |
| Base 3 | 211000120 |
| As time | 16053 seconds = 4 h 27 min 33 s |
Is 16053 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 (16053 ÷ 3 = 5351) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 5) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16053 a prime number?
No. 16053 = 3 × 5351, so it is divisible by 3.
What are the factors of 16053?
1, 3, 5351, 16053.
What is 16053 in binary?
11111010110101 (hexadecimal 3EB5, octal 37265).
What is the square root of 16053?
About 126.7004.
Is 16053 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 16053?
16053 is a semiprime: 3 × 5351, the product of two primes.