The number 42851
42851 is a composite number with 4 divisors. Its prime factorisation is 73 × 587. Divisors (4): 1, 73, 587, 42851.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 42851: a semiprime: 73 × 587, the product of two primes.
- 2
42851 is composite. Its prime factorisation is
- 3
The divisors add up to 43512; without 42851 itself that is 661, so 42851 is deficient (661 is less than 42851). Euler's totient φ(42851) = 42192 numbers up to 42851 share no factor with it.
- 4
The digits of 42851 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42851 = 73 \times 587 \]
42851 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 43512 |
| Euler totient φ(n) | 42192 |
| Square | 1836208201 |
| Cube | 78683357621051 |
| Square root | 207.004831 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 31 |
| Scientific notation | 4.2851 × |
42851 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand eight hundred and fifty-one |
| Binary (base 2) | 1010011101100011 |
| Octal (base 8) | 123543 |
| Hexadecimal (base 16) | A763 |
| Base 3 | 2011210002 |
| As time | 42851 seconds = 11 h 54 min 11 s |
Is 42851 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 | No (remainder 2) | 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 5) | 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 | No (remainder 2) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 42851 a prime number?
No. 42851 = 73 × 587, so it is divisible by 73.
What are the factors of 42851?
1, 73, 587, 42851.
What is 42851 in binary?
1010011101100011 (hexadecimal A763, octal 123543).
What is the square root of 42851?
About 207.0048.
Is 42851 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 42851?
42851 is a semiprime: 73 × 587, the product of two primes.