The number 4851
4851 is a triangular number: 1 + 2 + … + 98 = 4851. Its prime factorisation is × × 11. Divisors (18): 1, 3, 7, 9, 11, 21, 33, 49, 63, 77, 99, 147, 231, 441, 539, 693 … 4851.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4851: a triangular number: 1 + 2 + … + 98 = 4851.
- 2
4851 is composite. Its prime factorisation is
- 3
The divisors add up to 8892; without 4851 itself that is 4041, so 4851 is deficient (4041 is less than 4851). Euler's totient φ(4851) = 2520 numbers up to 4851 share no factor with it.
- 4
The digits of 4851 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 165 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4851 = 3^{2} \times 7^{2} \times 11 \]4851 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 8892 |
| Euler totient φ(n) | 2520 |
| Square | 23532201 |
| Cube | 114154707051 |
| Square root | 69.649121 (= 21√11) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 165 |
| Scientific notation | 4.851 × |
4851 in other forms
| Form | Value |
|---|---|
| In words | four thousand eight hundred and fifty-one |
| Binary (base 2) | 1001011110011 |
| Octal (base 8) | 11363 |
| Hexadecimal (base 16) | 12F3 |
| Base 3 | 20122200 |
| As time | 4851 seconds = 1 h 20 min 51 s |
Is 4851 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 | Yes (4851 ÷ 3 = 1617) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (4851 ÷ 7 = 693) | 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 | Yes (4851 ÷ 9 = 539) | 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 | Yes (4851 ÷ 11 = 441) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4851 a prime number?
No. 4851 = × × 11, so it is divisible by 3.
What are the factors of 4851?
1, 3, 7, 9, 11, 21, 33, 49, 63, 77, 99, 147, 231, 441, 539, 693, 1617, 4851.
What is 4851 in binary?
1001011110011 (hexadecimal 12F3, octal 11363).
What is the square root of 4851?
About 69.6491, exactly 21√11.
Is 4851 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 4851?
4851 is a triangular number: 1 + 2 + … + 98 = 4851.