The number 4751
4751 is the 640th prime number. Its only divisors are 1 and 4751.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4751: the 640th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
4751 is prime, so its only factors are 1 and 4751. It is the 640th prime; the next prime is 4759 and the one before is 4733.
- 3
The divisors add up to 4752; without 4751 itself that is 1, so 4751 is deficient (1 is less than 4751). Euler's totient φ(4751) = 4750 numbers up to 4751 share no factor with it.
- 4
The digits of 4751 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 165 steps to reach 1.
4751 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 4752 |
| Euler totient φ(n) | 4750 |
| Square | 22572001 |
| Cube | 107239576751 |
| Square root | 68.927498 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 165 |
| Scientific notation | 4.751 × |
4751 in other forms
| Form | Value |
|---|---|
| In words | four thousand seven hundred and fifty-one |
| Binary (base 2) | 1001010001111 |
| Octal (base 8) | 11217 |
| Hexadecimal (base 16) | 128F |
| Base 3 | 20111222 |
| As time | 4751 seconds = 1 h 19 min 11 s |
Is 4751 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 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 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 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 4751 a prime number?
Yes. 4751 is divisible only by 1 and itself.
What are the factors of 4751?
1, 4751.
What is 4751 in binary?
1001010001111 (hexadecimal 128F, octal 11217).
What is the square root of 4751?
About 68.9275.
Is 4751 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 4751?
4751 is the 640th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.