The number 19126
19126 is a composite number with 8 divisors. Its prime factorisation is 2 × 73 × 131. Divisors (8): 1, 2, 73, 131, 146, 262, 9563, 19126.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19126 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19126 is composite. Its prime factorisation is
- 3
The divisors add up to 29304; without 19126 itself that is 10178, so 19126 is deficient (10178 is less than 19126). Euler's totient φ(19126) = 9360 numbers up to 19126 share no factor with it.
- 4
The digits of 19126 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 198 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19126 = 2 \times 73 \times 131 \]
19126 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 29304 |
| Euler totient φ(n) | 9360 |
| Square | 365803876 |
| Cube | 6996364932376 |
| Square root | 138.296782 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 198 |
| Scientific notation | 1.9126 × |
19126 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand one hundred and twenty-six |
| Binary (base 2) | 100101010110110 |
| Octal (base 8) | 45266 |
| Hexadecimal (base 16) | 4AB6 |
| Base 3 | 222020101 |
| As time | 19126 seconds = 5 h 18 min 46 s |
Is 19126 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19126 ÷ 2 = 9563) | 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 | No (remainder 2) | 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 4) | 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 6) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19126 a prime number?
No. 19126 = 2 × 73 × 131, so it is divisible by 2.
What are the factors of 19126?
1, 2, 73, 131, 146, 262, 9563, 19126.
What is 19126 in binary?
100101010110110 (hexadecimal 4AB6, octal 45266).
What is the square root of 19126?
About 138.2968.
Is 19126 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 19126?
It is a composite number with 8 divisors.