The number 33141
33141 is a composite number with 4 divisors. Its prime factorisation is 3 × 11047. Divisors (4): 1, 3, 11047, 33141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 33141: a semiprime: 3 × 11047, the product of two primes.
- 2
33141 is composite. Its prime factorisation is
- 3
The divisors add up to 44192; without 33141 itself that is 11051, so 33141 is deficient (11051 is less than 33141). Euler's totient φ(33141) = 22092 numbers up to 33141 share no factor with it.
- 4
The digits of 33141 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 129 steps to reach 1.
LaTeX source of the formulas on this page
\[ 33141 = 3 \times 11047 \]
33141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 44192 |
| Euler totient φ(n) | 22092 |
| Square | 1098325881 |
| Cube | 36399618022221 |
| Square root | 182.046697 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 129 |
| Scientific notation | 3.3141 × |
33141 in other forms
| Form | Value |
|---|---|
| In words | thirty-three thousand one hundred and forty-one |
| Binary (base 2) | 1000000101110101 |
| Octal (base 8) | 100565 |
| Hexadecimal (base 16) | 8175 |
| Base 3 | 1200110110 |
| As time | 33141 seconds = 9 h 12 min 21 s |
Is 33141 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 (33141 ÷ 3 = 11047) | 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 3) | 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 9) | 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 33141 a prime number?
No. 33141 = 3 × 11047, so it is divisible by 3.
What are the factors of 33141?
1, 3, 11047, 33141.
What is 33141 in binary?
1000000101110101 (hexadecimal 8175, octal 100565).
What is the square root of 33141?
About 182.0467.
Is 33141 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 33141?
33141 is a semiprime: 3 × 11047, the product of two primes.