The number 16271
16271 is a composite number with 4 divisors. Its prime factorisation is 53 × 307. Divisors (4): 1, 53, 307, 16271.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16271: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 53 × 307, the product of two primes.
- 2
16271 is composite. Its prime factorisation is
- 3
The divisors add up to 16632; without 16271 itself that is 361, so 16271 is deficient (361 is less than 16271). Euler's totient φ(16271) = 15912 numbers up to 16271 share no factor with it.
- 4
The digits of 16271 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 66 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16271 = 53 \times 307 \]
16271 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16632 |
| Euler totient φ(n) | 15912 |
| Square | 264745441 |
| Cube | 4307673070511 |
| Square root | 127.557830 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 66 |
| Scientific notation | 1.6271 × |
16271 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand two hundred and seventy-one |
| Binary (base 2) | 11111110001111 |
| Octal (base 8) | 37617 |
| Hexadecimal (base 16) | 3F8F |
| Base 3 | 211022122 |
| As time | 16271 seconds = 4 h 31 min 11 s |
Is 16271 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16271 a prime number?
No. 16271 = 53 × 307, so it is divisible by 53.
What are the factors of 16271?
1, 53, 307, 16271.
What is 16271 in binary?
11111110001111 (hexadecimal 3F8F, octal 37617).
What is the square root of 16271?
About 127.5578.
Is 16271 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 16271?
16271 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 53 × 307, the product of two primes.