The number 4951
4951 is the 662nd prime number. Its only divisors are 1 and 4951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4951: the 662nd prime number.
- 2
4951 is prime, so its only factors are 1 and 4951. It is the 662nd prime; the next prime is 4957 and the one before is 4943.
- 3
The divisors add up to 4952; without 4951 itself that is 1, so 4951 is deficient (1 is less than 4951). Euler's totient φ(4951) = 4950 numbers up to 4951 share no factor with it.
- 4
The digits of 4951 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 72 steps to reach 1.
4951 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 4952 |
| Euler totient φ(n) | 4950 |
| Square | 24512401 |
| Cube | 121360897351 |
| Square root | 70.363343 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 72 |
| Scientific notation | 4.951 × |
4951 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and fifty-one |
| Binary (base 2) | 1001101010111 |
| Octal (base 8) | 11527 |
| Hexadecimal (base 16) | 1357 |
| Base 3 | 20210101 |
| As time | 4951 seconds = 1 h 22 min 31 s |
Is 4951 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 1) | 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 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 4951 a prime number?
Yes. 4951 is divisible only by 1 and itself.
What are the factors of 4951?
1, 4951.
What is 4951 in binary?
1001101010111 (hexadecimal 1357, octal 11527).
What is the square root of 4951?
About 70.3633.
Is 4951 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 4951?
4951 is the 662nd prime number.