The number 19792
19792 is a composite number with 10 divisors. Its prime factorisation is × 1237. Divisors (10): 1, 2, 4, 8, 16, 1237, 2474, 4948, 9896, 19792.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19792 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19792 is composite. Its prime factorisation is
- 3
The divisors add up to 38378; without 19792 itself that is 18586, so 19792 is deficient (18586 is less than 19792). Euler's totient φ(19792) = 9888 numbers up to 19792 share no factor with it.
- 4
The digits of 19792 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 30 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19792 = 2^{4} \times 1237 \]19792 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 38378 |
| Euler totient φ(n) | 9888 |
| Square | 391723264 |
| Cube | 7752986841088 |
| Square root | 140.684043 (= 4√1237) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 30 |
| Scientific notation | 1.9792 × |
19792 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand seven hundred and ninety-two |
| Binary (base 2) | 100110101010000 |
| Octal (base 8) | 46520 |
| Hexadecimal (base 16) | 4D50 |
| Base 3 | 1000011001 |
| As time | 19792 seconds = 5 h 29 min 52 s |
Is 19792 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19792 ÷ 2 = 9896) | 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 | Yes (19792 ÷ 4 = 4948) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 | Yes (19792 ÷ 8 = 2474) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19792 a prime number?
No. 19792 = × 1237, so it is divisible by 2.
What are the factors of 19792?
1, 2, 4, 8, 16, 1237, 2474, 4948, 9896, 19792.
What is 19792 in binary?
100110101010000 (hexadecimal 4D50, octal 46520).
What is the square root of 19792?
About 140.6840, exactly 4√1237.
Is 19792 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 19792?
It is a composite number with 10 divisors.