The number 15441
15441 is a composite number with 4 divisors. Its prime factorisation is 3 × 5147. Divisors (4): 1, 3, 5147, 15441.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15441: a semiprime: 3 × 5147, the product of two primes.
- 2
15441 is composite. Its prime factorisation is
- 3
The divisors add up to 20592; without 15441 itself that is 5151, so 15441 is deficient (5151 is less than 15441). Euler's totient φ(15441) = 10292 numbers up to 15441 share no factor with it.
- 4
The digits of 15441 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15441 = 3 \times 5147 \]
15441 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20592 |
| Euler totient φ(n) | 10292 |
| Square | 238424481 |
| Cube | 3681512411121 |
| Square root | 124.261820 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.5441 × |
15441 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand four hundred and forty-one |
| Binary (base 2) | 11110001010001 |
| Octal (base 8) | 36121 |
| Hexadecimal (base 16) | 3C51 |
| Base 3 | 210011220 |
| As time | 15441 seconds = 4 h 17 min 21 s |
Is 15441 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 | Yes (15441 ÷ 3 = 5147) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15441 a prime number?
No. 15441 = 3 × 5147, so it is divisible by 3.
What are the factors of 15441?
1, 3, 5147, 15441.
What is 15441 in binary?
11110001010001 (hexadecimal 3C51, octal 36121).
What is the square root of 15441?
About 124.2618.
Is 15441 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 15441?
15441 is a semiprime: 3 × 5147, the product of two primes.