The number 15041
15041 is a composite number with 6 divisors. Its prime factorisation is Ć 89. Divisors (6): 1, 13, 89, 169, 1157, 15041.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15041 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15041 is composite. Its prime factorisation is
- 3
The divisors add up to 16470; without 15041 itself that is 1429, so 15041 is deficient (1429 is less than 15041). Euler's totient Ļ(15041) = 13728 numbers up to 15041 share no factor with it.
- 4
The digits of 15041 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15041 = 13^{2} \times 89 \]15041 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 16470 |
| Euler totient Ļ(n) | 13728 |
| Square | 226231681 |
| Cube | 3402750713921 |
| Square root | 122.641755 (= 13ā89) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.5041 Ć |
15041 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and forty-one |
| Binary (base 2) | 11101011000001 |
| Octal (base 8) | 35301 |
| Hexadecimal (base 16) | 3AC1 |
| Base 3 | 202122002 |
| As time | 15041 seconds = 4 h 10 min 41 s |
Is 15041 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15041 a prime number?
No. 15041 = Ć 89, so it is divisible by 13.
What are the factors of 15041?
1, 13, 89, 169, 1157, 15041.
What is 15041 in binary?
11101011000001 (hexadecimal 3AC1, octal 35301).
What is the square root of 15041?
About 122.6418, exactly 13ā89.
Is 15041 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 15041?
It is a composite number with 6 divisors.