The number 30141
30141 is a composite number with 12 divisors. Its prime factorisation is × 17 × 197. Divisors (12): 1, 3, 9, 17, 51, 153, 197, 591, 1773, 3349, 10047, 30141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30141: a Harshad number: divisible by its digit sum 9.
- 2
30141 is composite. Its prime factorisation is
- 3
The divisors add up to 46332; without 30141 itself that is 16191, so 30141 is deficient (16191 is less than 30141). Euler's totient φ(30141) = 18816 numbers up to 30141 share no factor with it.
- 4
The digits of 30141 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 90 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30141 = 3^{2} \times 17 \times 197 \]30141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 46332 |
| Euler totient φ(n) | 18816 |
| Square | 908479881 |
| Cube | 27382492093221 |
| Square root | 173.611636 (= 3√3349) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 90 |
| Scientific notation | 3.0141 × |
30141 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand one hundred and forty-one |
| Binary (base 2) | 111010110111101 |
| Octal (base 8) | 72675 |
| Hexadecimal (base 16) | 75BD |
| Base 3 | 1112100100 |
| As time | 30141 seconds = 8 h 22 min 21 s |
Is 30141 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 (30141 ÷ 3 = 10047) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (30141 ÷ 9 = 3349) | 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 1) | 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 30141 a prime number?
No. 30141 = × 17 × 197, so it is divisible by 3.
What are the factors of 30141?
1, 3, 9, 17, 51, 153, 197, 591, 1773, 3349, 10047, 30141.
What is 30141 in binary?
111010110111101 (hexadecimal 75BD, octal 72675).
What is the square root of 30141?
About 173.6116, exactly 3√3349.
Is 30141 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 30141?
30141 is a Harshad number: divisible by its digit sum 9.