The number 16147
16147 is a composite number with 4 divisors. Its prime factorisation is 67 × 241. Divisors (4): 1, 67, 241, 16147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16147: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 67 × 241, the product of two primes.
- 2
16147 is composite. Its prime factorisation is
- 3
The divisors add up to 16456; without 16147 itself that is 309, so 16147 is deficient (309 is less than 16147). Euler's totient φ(16147) = 15840 numbers up to 16147 share no factor with it.
- 4
The digits of 16147 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 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16147 = 67 \times 241 \]
16147 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16456 |
| Euler totient φ(n) | 15840 |
| Square | 260725609 |
| Cube | 4209936408523 |
| Square root | 127.070846 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 97 |
| Scientific notation | 1.6147 × |
16147 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand one hundred and forty-seven |
| Binary (base 2) | 11111100010011 |
| Octal (base 8) | 37423 |
| Hexadecimal (base 16) | 3F13 |
| Base 3 | 211011001 |
| As time | 16147 seconds = 4 h 29 min 7 s |
Is 16147 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 2) | 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 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 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 16147 a prime number?
No. 16147 = 67 × 241, so it is divisible by 67.
What are the factors of 16147?
1, 67, 241, 16147.
What is 16147 in binary?
11111100010011 (hexadecimal 3F13, octal 37423).
What is the square root of 16147?
About 127.0708.
Is 16147 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 16147?
16147 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 67 × 241, the product of two primes.