The number 42151
42151 is a composite number with 4 divisors. Its prime factorisation is 61 × 691. Divisors (4): 1, 61, 691, 42151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 42151: a semiprime: 61 × 691, the product of two primes.
- 2
42151 is composite. Its prime factorisation is
- 3
The divisors add up to 42904; without 42151 itself that is 753, so 42151 is deficient (753 is less than 42151). Euler's totient φ(42151) = 41400 numbers up to 42151 share no factor with it.
- 4
The digits of 42151 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 194 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42151 = 61 \times 691 \]
42151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 42904 |
| Euler totient φ(n) | 41400 |
| Square | 1776706801 |
| Cube | 74889968368951 |
| Square root | 205.307087 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 194 |
| Scientific notation | 4.2151 × |
42151 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand one hundred and fifty-one |
| Binary (base 2) | 1010010010100111 |
| Octal (base 8) | 122247 |
| Hexadecimal (base 16) | A4A7 |
| Base 3 | 2010211011 |
| As time | 42151 seconds = 11 h 42 min 31 s |
Is 42151 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 1) | 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 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 42151 a prime number?
No. 42151 = 61 × 691, so it is divisible by 61.
What are the factors of 42151?
1, 61, 691, 42151.
What is 42151 in binary?
1010010010100111 (hexadecimal A4A7, octal 122247).
What is the square root of 42151?
About 205.3071.
Is 42151 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 42151?
42151 is a semiprime: 61 × 691, the product of two primes.