The number 19312
19312 is a composite number with 20 divisors. Its prime factorisation is × 17 × 71. Divisors (20): 1, 2, 4, 8, 16, 17, 34, 68, 71, 136, 142, 272, 284, 568, 1136, 1207 … 19312.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19312: a Harshad number: divisible by its digit sum 16.
- 2
19312 is composite. Its prime factorisation is
- 3
The divisors add up to 40176; without 19312 itself that is 20864, so 19312 is abundant (20864 is more than 19312). Euler's totient φ(19312) = 8960 numbers up to 19312 share no factor with it.
- 4
The digits of 19312 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 74 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19312 = 2^{4} \times 17 \times 71 \]19312 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 40176 |
| Euler totient φ(n) | 8960 |
| Square | 372953344 |
| Cube | 7202474979328 |
| Square root | 138.967622 (= 4√1207) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 74 |
| Scientific notation | 1.9312 × |
19312 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand three hundred and twelve |
| Binary (base 2) | 100101101110000 |
| Octal (base 8) | 45560 |
| Hexadecimal (base 16) | 4B70 |
| Base 3 | 222111021 |
| As time | 19312 seconds = 5 h 21 min 52 s |
Is 19312 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19312 ÷ 2 = 9656) | 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 (19312 ÷ 4 = 4828) | 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 6) | 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 (19312 ÷ 8 = 2414) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 7) | 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 19312 a prime number?
No. 19312 = × 17 × 71, so it is divisible by 2.
What are the factors of 19312?
1, 2, 4, 8, 16, 17, 34, 68, 71, 136, 142, 272, 284, 568, 1136, 1207, 2414, 4828, 9656, 19312.
What is 19312 in binary?
100101101110000 (hexadecimal 4B70, octal 45560).
What is the square root of 19312?
About 138.9676, exactly 4√1207.
Is 19312 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 19312?
19312 is a Harshad number: divisible by its digit sum 16.