The number 4791
4791 is a composite number with 4 divisors. Its prime factorisation is 3 × 1597. Divisors (4): 1, 3, 1597, 4791.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4791: a semiprime: 3 × 1597, the product of two primes.
- 2
4791 is composite. Its prime factorisation is
- 3
The divisors add up to 6392; without 4791 itself that is 1601, so 4791 is deficient (1601 is less than 4791). Euler's totient φ(4791) = 3192 numbers up to 4791 share no factor with it.
- 4
The digits of 4791 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 33 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4791 = 3 \times 1597 \]
4791 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6392 |
| Euler totient φ(n) | 3192 |
| Square | 22953681 |
| Cube | 109971085671 |
| Square root | 69.217050 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 33 |
| Scientific notation | 4.791 × |
4791 in other forms
| Form | Value |
|---|---|
| In words | four thousand seven hundred and ninety-one |
| Binary (base 2) | 1001010110111 |
| Octal (base 8) | 11267 |
| Hexadecimal (base 16) | 12B7 |
| Base 3 | 20120110 |
| As time | 4791 seconds = 1 h 19 min 51 s |
Is 4791 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 (4791 ÷ 3 = 1597) | 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 | No (remainder 3) | 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 3) | 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 6) | 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 4791 a prime number?
No. 4791 = 3 × 1597, so it is divisible by 3.
What are the factors of 4791?
1, 3, 1597, 4791.
What is 4791 in binary?
1001010110111 (hexadecimal 12B7, octal 11267).
What is the square root of 4791?
About 69.2170.
Is 4791 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 4791?
4791 is a semiprime: 3 × 1597, the product of two primes.