The number 42291
42291 is a composite number with 12 divisors. Its prime factorisation is × 37 × 127. Divisors (12): 1, 3, 9, 37, 111, 127, 333, 381, 1143, 4699, 14097, 42291.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
42291 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
42291 is composite. Its prime factorisation is
- 3
The divisors add up to 63232; without 42291 itself that is 20941, so 42291 is deficient (20941 is less than 42291). Euler's totient φ(42291) = 27216 numbers up to 42291 share no factor with it.
- 4
The digits of 42291 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 150 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42291 = 3^{2} \times 37 \times 127 \]42291 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 63232 |
| Euler totient φ(n) | 27216 |
| Square | 1788528681 |
| Cube | 75638666448171 |
| Square root | 205.647757 (= 3√4699) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 150 |
| Scientific notation | 4.2291 × |
42291 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand two hundred and ninety-one |
| Binary (base 2) | 1010010100110011 |
| Octal (base 8) | 122463 |
| Hexadecimal (base 16) | A533 |
| Base 3 | 2011000100 |
| As time | 42291 seconds = 11 h 44 min 51 s |
Is 42291 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 (42291 ÷ 3 = 14097) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 4) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (42291 ÷ 9 = 4699) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 42291 a prime number?
No. 42291 = × 37 × 127, so it is divisible by 3.
What are the factors of 42291?
1, 3, 9, 37, 111, 127, 333, 381, 1143, 4699, 14097, 42291.
What is 42291 in binary?
1010010100110011 (hexadecimal A533, octal 122463).
What is the square root of 42291?
About 205.6478, exactly 3√4699.
Is 42291 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 42291?
It is a composite number with 12 divisors.