The number 42051
42051 is a composite number with 8 divisors. Its prime factorisation is 3 × 107 × 131. Divisors (8): 1, 3, 107, 131, 321, 393, 14017, 42051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
42051 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
42051 is composite. Its prime factorisation is
- 3
The divisors add up to 57024; without 42051 itself that is 14973, so 42051 is deficient (14973 is less than 42051). Euler's totient φ(42051) = 27560 numbers up to 42051 share no factor with it.
- 4
The digits of 42051 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 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42051 = 3 \times 107 \times 131 \]
42051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 57024 |
| Euler totient φ(n) | 27560 |
| Square | 1768286601 |
| Cube | 74358219858651 |
| Square root | 205.063405 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 88 |
| Scientific notation | 4.2051 × |
42051 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand and fifty-one |
| Binary (base 2) | 1010010001000011 |
| Octal (base 8) | 122103 |
| Hexadecimal (base 16) | A443 |
| Base 3 | 2010200110 |
| As time | 42051 seconds = 11 h 40 min 51 s |
Is 42051 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 (42051 ÷ 3 = 14017) | 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 2) | 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 | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 42051 a prime number?
No. 42051 = 3 × 107 × 131, so it is divisible by 3.
What are the factors of 42051?
1, 3, 107, 131, 321, 393, 14017, 42051.
What is 42051 in binary?
1010010001000011 (hexadecimal A443, octal 122103).
What is the square root of 42051?
About 205.0634.
Is 42051 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 42051?
It is a composite number with 8 divisors.