The number 5147
5147 is the 686th prime number. Its only divisors are 1 and 5147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5147: the 686th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
5147 is prime, so its only factors are 1 and 5147. It is the 686th prime; the next prime is 5153 and the one before is 5119.
- 3
The divisors add up to 5148; without 5147 itself that is 1, so 5147 is deficient (1 is less than 5147). Euler's totient φ(5147) = 5146 numbers up to 5147 share no factor with it.
- 4
The digits of 5147 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 116 steps to reach 1.
5147 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 5148 |
| Euler totient φ(n) | 5146 |
| Square | 26491609 |
| Cube | 136352311523 |
| Square root | 71.742595 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 116 |
| Scientific notation | 5.147 × |
5147 in other forms
| Form | Value |
|---|---|
| In words | five thousand one hundred and forty-seven |
| Binary (base 2) | 1010000011011 |
| Octal (base 8) | 12033 |
| Hexadecimal (base 16) | 141B |
| Base 3 | 21001122 |
| As time | 5147 seconds = 1 h 25 min 47 s |
Is 5147 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 2) | 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 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 8) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5147 a prime number?
Yes. 5147 is divisible only by 1 and itself.
What are the factors of 5147?
1, 5147.
What is 5147 in binary?
1010000011011 (hexadecimal 141B, octal 12033).
What is the square root of 5147?
About 71.7426.
Is 5147 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 5147?
5147 is the 686th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.