The number 15141
15141 is a composite number with 12 divisors. Its prime factorisation is 3 × × 103. Divisors (12): 1, 3, 7, 21, 49, 103, 147, 309, 721, 2163, 5047, 15141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15141: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
15141 is composite. Its prime factorisation is
- 3
The divisors add up to 23712; without 15141 itself that is 8571, so 15141 is deficient (8571 is less than 15141). Euler's totient φ(15141) = 8568 numbers up to 15141 share no factor with it.
- 4
The digits of 15141 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15141 = 3 \times 7^{2} \times 103 \]15141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 23712 |
| Euler totient φ(n) | 8568 |
| Square | 229249881 |
| Cube | 3471072448221 |
| Square root | 123.048771 (= 7√309) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.5141 × |
15141 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and forty-one |
| Binary (base 2) | 11101100100101 |
| Octal (base 8) | 35445 |
| Hexadecimal (base 16) | 3B25 |
| Base 3 | 202202210 |
| As time | 15141 seconds = 4 h 12 min 21 s |
Is 15141 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 (15141 ÷ 3 = 5047) | 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 | Yes (15141 ÷ 7 = 2163) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 5) | 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 15141 a prime number?
No. 15141 = 3 × × 103, so it is divisible by 3.
What are the factors of 15141?
1, 3, 7, 21, 49, 103, 147, 309, 721, 2163, 5047, 15141.
What is 15141 in binary?
11101100100101 (hexadecimal 3B25, octal 35445).
What is the square root of 15141?
About 123.0488, exactly 7√309.
Is 15141 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 15141?
15141 is a happy number: repeatedly adding the squares of its digits reaches 1.