The number 16051
16051 is a composite number with 4 divisors. Its prime factorisation is 7 × 2293. Divisors (4): 1, 7, 2293, 16051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16051: a semiprime: 7 × 2293, the product of two primes.
- 2
16051 is composite. Its prime factorisation is
- 3
The divisors add up to 18352; without 16051 itself that is 2301, so 16051 is deficient (2301 is less than 16051). Euler's totient φ(16051) = 13752 numbers up to 16051 share no factor with it.
- 4
The digits of 16051 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16051 = 7 \times 2293 \]
16051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 18352 |
| Euler totient φ(n) | 13752 |
| Square | 257634601 |
| Cube | 4135292980651 |
| Square root | 126.692541 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.6051 × |
16051 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand and fifty-one |
| Binary (base 2) | 11111010110011 |
| Octal (base 8) | 37263 |
| Hexadecimal (base 16) | 3EB3 |
| Base 3 | 211000111 |
| As time | 16051 seconds = 4 h 27 min 31 s |
Is 16051 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 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (16051 ÷ 7 = 2293) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16051 a prime number?
No. 16051 = 7 × 2293, so it is divisible by 7.
What are the factors of 16051?
1, 7, 2293, 16051.
What is 16051 in binary?
11111010110011 (hexadecimal 3EB3, octal 37263).
What is the square root of 16051?
About 126.6925.
Is 16051 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 16051?
16051 is a semiprime: 7 × 2293, the product of two primes.