The number 19151
19151 is a composite number with 4 divisors. Its prime factorisation is 11 × 1741. Divisors (4): 1, 11, 1741, 19151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19151: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 1741, the product of two primes.
- 2
19151 is composite. Its prime factorisation is
- 3
The divisors add up to 20904; without 19151 itself that is 1753, so 19151 is deficient (1753 is less than 19151). Euler's totient φ(19151) = 17400 numbers up to 19151 share no factor with it.
- 4
The digits of 19151 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 198 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19151 = 11 \times 1741 \]
19151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20904 |
| Euler totient φ(n) | 17400 |
| Square | 366760801 |
| Cube | 7023836099951 |
| Square root | 138.387138 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 198 |
| Scientific notation | 1.9151 × |
19151 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand one hundred and fifty-one |
| Binary (base 2) | 100101011001111 |
| Octal (base 8) | 45317 |
| Hexadecimal (base 16) | 4ACF |
| Base 3 | 222021022 |
| As time | 19151 seconds = 5 h 19 min 11 s |
Is 19151 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 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 | No (remainder 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 | Yes (19151 ÷ 11 = 1741) | 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 19151 a prime number?
No. 19151 = 11 × 1741, so it is divisible by 11.
What are the factors of 19151?
1, 11, 1741, 19151.
What is 19151 in binary?
100101011001111 (hexadecimal 4ACF, octal 45317).
What is the square root of 19151?
About 138.3871.
Is 19151 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 19151?
19151 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 1741, the product of two primes.