The number 19791
19791 is a palindrome: it reads 19791 backwards too. Its prime factorisation is × 733. Divisors (8): 1, 3, 9, 27, 733, 2199, 6597, 19791.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19791: a palindrome: it reads 19791 backwards too; a Harshad number: divisible by its digit sum 27.
- 2
19791 is composite. Its prime factorisation is
- 3
The divisors add up to 29360; without 19791 itself that is 9569, so 19791 is deficient (9569 is less than 19791). Euler's totient φ(19791) = 13176 numbers up to 19791 share no factor with it.
- 4
The digits of 19791 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 123 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19791 = 3^{3} \times 733 \]19791 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 29360 |
| Euler totient φ(n) | 13176 |
| Square | 391683681 |
| Cube | 7751811730671 |
| Square root | 140.680489 (= 3√2199) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 123 |
| Scientific notation | 1.9791 × |
19791 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand seven hundred and ninety-one |
| Binary (base 2) | 100110101001111 |
| Octal (base 8) | 46517 |
| Hexadecimal (base 16) | 4D4F |
| Base 3 | 1000011000 |
| As time | 19791 seconds = 5 h 29 min 51 s |
Is 19791 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 (19791 ÷ 3 = 6597) | 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 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 | Yes (19791 ÷ 9 = 2199) | 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 2) | 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 19791 a prime number?
No. 19791 = × 733, so it is divisible by 3.
What are the factors of 19791?
1, 3, 9, 27, 733, 2199, 6597, 19791.
What is 19791 in binary?
100110101001111 (hexadecimal 4D4F, octal 46517).
What is the square root of 19791?
About 140.6805, exactly 3√2199.
Is 19791 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 19791?
19791 is a palindrome: it reads 19791 backwards too; a Harshad number: divisible by its digit sum 27.