The number 141
141 is a palindrome: it reads 141 backwards too. Its prime factorisation is 3 × 47. Divisors (4): 1, 3, 47, 141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 141: a palindrome: it reads 141 backwards too; a semiprime: 3 × 47, the product of two primes.
- 2
141 is composite. Its prime factorisation is
- 3
The divisors add up to 192; without 141 itself that is 51, so 141 is deficient (51 is less than 141). Euler's totient φ(141) = 92 numbers up to 141 share no factor with it.
- 4
The digits of 141 add up to 6, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 15 steps to reach 1.
LaTeX source of the formulas on this page
\[ 141 = 3 \times 47 \]
141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 192 |
| Euler totient φ(n) | 92 |
| Square | 19881 |
| Cube | 2803221 |
| Square root | 11.874342 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 15 |
| Scientific notation | 1.41 × |
141 in other forms
| Form | Value |
|---|---|
| In words | one hundred and forty-one |
| Roman numerals | CXLI |
| Binary (base 2) | 10001101 |
| Octal (base 8) | 215 |
| Hexadecimal (base 16) | 8D |
| Base 3 | 12020 |
| As time | 141 seconds = 2 min 21 s |
Is 141 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 (141 ÷ 3 = 47) | 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 1) | 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 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 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 141 a prime number?
No. 141 = 3 × 47, so it is divisible by 3.
What are the factors of 141?
1, 3, 47, 141.
What is 141 in binary?
10001101 (hexadecimal 8D, octal 215).
What is the square root of 141?
About 11.8743.
What is 141 in Roman numerals?
CXLI.
Is 141 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 141?
141 is a palindrome: it reads 141 backwards too; a semiprime: 3 × 47, the product of two primes.