The number 15491
15491 is a composite number with 4 divisors. Its prime factorisation is 7 × 2213. Divisors (4): 1, 7, 2213, 15491.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15491: a semiprime: 7 × 2213, the product of two primes.
- 2
15491 is composite. Its prime factorisation is
- 3
The divisors add up to 17712; without 15491 itself that is 2221, so 15491 is deficient (2221 is less than 15491). Euler's totient φ(15491) = 13272 numbers up to 15491 share no factor with it.
- 4
The digits of 15491 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 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15491 = 7 \times 2213 \]
15491 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17712 |
| Euler totient φ(n) | 13272 |
| Square | 239971081 |
| Cube | 3717392015771 |
| Square root | 124.462846 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5491 × |
15491 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand four hundred and ninety-one |
| Binary (base 2) | 11110010000011 |
| Octal (base 8) | 36203 |
| Hexadecimal (base 16) | 3C83 |
| Base 3 | 210020202 |
| As time | 15491 seconds = 4 h 18 min 11 s |
Is 15491 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 | Yes (15491 ÷ 7 = 2213) | 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 3) | 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 3) | 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 15491 a prime number?
No. 15491 = 7 × 2213, so it is divisible by 7.
What are the factors of 15491?
1, 7, 2213, 15491.
What is 15491 in binary?
11110010000011 (hexadecimal 3C83, octal 36203).
What is the square root of 15491?
About 124.4628.
Is 15491 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 15491?
15491 is a semiprime: 7 × 2213, the product of two primes.