The number 19631
19631 is a composite number with 4 divisors. Its prime factorisation is 67 × 293. Divisors (4): 1, 67, 293, 19631.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19631: a semiprime: 67 × 293, the product of two primes.
- 2
19631 is composite. Its prime factorisation is
- 3
The divisors add up to 19992; without 19631 itself that is 361, so 19631 is deficient (361 is less than 19631). Euler's totient φ(19631) = 19272 numbers up to 19631 share no factor with it.
- 4
The digits of 19631 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 105 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19631 = 67 \times 293 \]
19631 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 19992 |
| Euler totient φ(n) | 19272 |
| Square | 385376161 |
| Cube | 7565319416591 |
| Square root | 140.110671 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 105 |
| Scientific notation | 1.9631 × |
19631 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and thirty-one |
| Binary (base 2) | 100110010101111 |
| Octal (base 8) | 46257 |
| Hexadecimal (base 16) | 4CAF |
| Base 3 | 222221002 |
| As time | 19631 seconds = 5 h 27 min 11 s |
Is 19631 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 | No (remainder 2) | 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 5) | 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 2) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19631 a prime number?
No. 19631 = 67 × 293, so it is divisible by 67.
What are the factors of 19631?
1, 67, 293, 19631.
What is 19631 in binary?
100110010101111 (hexadecimal 4CAF, octal 46257).
What is the square root of 19631?
About 140.1107.
Is 19631 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 19631?
19631 is a semiprime: 67 × 293, the product of two primes.