The number 13147
13147 is the 1563rd prime number. Its only divisors are 1 and 13147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13147: the 1563rd prime number.
- 2
13147 is prime, so its only factors are 1 and 13147. It is the 1563rd prime; the next prime is 13151 and the one before is 13127.
- 3
The divisors add up to 13148; without 13147 itself that is 1, so 13147 is deficient (1 is less than 13147). Euler's totient φ(13147) = 13146 numbers up to 13147 share no factor with it.
- 4
The digits of 13147 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
13147 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 13148 |
| Euler totient φ(n) | 13146 |
| Square | 172843609 |
| Cube | 2272374927523 |
| Square root | 114.660368 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.3147 × |
13147 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand one hundred and forty-seven |
| Binary (base 2) | 11001101011011 |
| Octal (base 8) | 31533 |
| Hexadecimal (base 16) | 335B |
| Base 3 | 200000221 |
| As time | 13147 seconds = 3 h 39 min 7 s |
Is 13147 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 1) | 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 7) | 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 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 13147 a prime number?
Yes. 13147 is divisible only by 1 and itself.
What are the factors of 13147?
1, 13147.
What is 13147 in binary?
11001101011011 (hexadecimal 335B, octal 31533).
What is the square root of 13147?
About 114.6604.
Is 13147 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 13147?
13147 is the 1563rd prime number.