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