The number 42951
42951 is a composite number with 8 divisors. Its prime factorisation is 3 × 103 × 139. Divisors (8): 1, 3, 103, 139, 309, 417, 14317, 42951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
42951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
42951 is composite. Its prime factorisation is
- 3
The divisors add up to 58240; without 42951 itself that is 15289, so 42951 is deficient (15289 is less than 42951). Euler's totient φ(42951) = 28152 numbers up to 42951 share no factor with it.
- 4
The digits of 42951 add up to 21, 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
\[ 42951 = 3 \times 103 \times 139 \]
42951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 58240 |
| Euler totient φ(n) | 28152 |
| Square | 1844788401 |
| Cube | 79235506611351 |
| Square root | 207.246230 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 88 |
| Scientific notation | 4.2951 × |
42951 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand nine hundred and fifty-one |
| Binary (base 2) | 1010011111000111 |
| Octal (base 8) | 123707 |
| Hexadecimal (base 16) | A7C7 |
| Base 3 | 2011220210 |
| As time | 42951 seconds = 11 h 55 min 51 s |
Is 42951 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 (42951 ÷ 3 = 14317) | 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 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 7) | 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 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 42951 a prime number?
No. 42951 = 3 × 103 × 139, so it is divisible by 3.
What are the factors of 42951?
1, 3, 103, 139, 309, 417, 14317, 42951.
What is 42951 in binary?
1010011111000111 (hexadecimal A7C7, octal 123707).
What is the square root of 42951?
About 207.2462.
Is 42951 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 42951?
It is a composite number with 8 divisors.