The number 146
146 is a composite number with 4 divisors. Its prime factorisation is 2 × 73. Divisors (4): 1, 2, 73, 146.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 146: a semiprime: 2 × 73, the product of two primes.
- 2
146 is composite. Its prime factorisation is
- 3
The divisors add up to 222; without 146 itself that is 76, so 146 is deficient (76 is less than 146). Euler's totient φ(146) = 72 numbers up to 146 share no factor with it.
- 4
The digits of 146 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 116 steps to reach 1.
LaTeX source of the formulas on this page
\[ 146 = 2 \times 73 \]
146 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 222 |
| Euler totient φ(n) | 72 |
| Square | 21316 |
| Cube | 3112136 |
| Square root | 12.083046 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 116 |
| Scientific notation | 1.46 × |
146 in other forms
| Form | Value |
|---|---|
| In words | one hundred and forty-six |
| Roman numerals | CXLVI |
| Binary (base 2) | 10010010 |
| Octal (base 8) | 222 |
| Hexadecimal (base 16) | 92 |
| Base 3 | 12102 |
| As time | 146 seconds = 2 min 26 s |
Is 146 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (146 ÷ 2 = 73) | 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 2) | 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 2) | 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 2) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 146 a prime number?
No. 146 = 2 × 73, so it is divisible by 2.
What are the factors of 146?
1, 2, 73, 146.
What is 146 in binary?
10010010 (hexadecimal 92, octal 222).
What is the square root of 146?
About 12.0830.
What is 146 in Roman numerals?
CXLVI.
Is 146 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 146?
146 is a semiprime: 2 × 73, the product of two primes.