The number 16291
16291 is a composite number with 4 divisors. Its prime factorisation is 11 × 1481. Divisors (4): 1, 11, 1481, 16291.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16291: a semiprime: 11 × 1481, the product of two primes.
- 2
16291 is composite. Its prime factorisation is
- 3
The divisors add up to 17784; without 16291 itself that is 1493, so 16291 is deficient (1493 is less than 16291). Euler's totient φ(16291) = 14800 numbers up to 16291 share no factor with it.
- 4
The digits of 16291 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 159 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16291 = 11 \times 1481 \]
16291 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17784 |
| Euler totient φ(n) | 14800 |
| Square | 265396681 |
| Cube | 4323577330171 |
| Square root | 127.636202 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 159 |
| Scientific notation | 1.6291 × |
16291 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand two hundred and ninety-one |
| Binary (base 2) | 11111110100011 |
| Octal (base 8) | 37643 |
| Hexadecimal (base 16) | 3FA3 |
| Base 3 | 211100101 |
| As time | 16291 seconds = 4 h 31 min 31 s |
Is 16291 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 | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 | Yes (16291 ÷ 11 = 1481) | 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 16291 a prime number?
No. 16291 = 11 × 1481, so it is divisible by 11.
What are the factors of 16291?
1, 11, 1481, 16291.
What is 16291 in binary?
11111110100011 (hexadecimal 3FA3, octal 37643).
What is the square root of 16291?
About 127.6362.
Is 16291 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 16291?
16291 is a semiprime: 11 × 1481, the product of two primes.