The number 42759
42759 is a composite number with 6 divisors. Its prime factorisation is × 4751. Divisors (6): 1, 3, 9, 4751, 14253, 42759.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
42759 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
42759 is composite. Its prime factorisation is
- 3
The divisors add up to 61776; without 42759 itself that is 19017, so 42759 is deficient (19017 is less than 42759). Euler's totient φ(42759) = 28500 numbers up to 42759 share no factor with it.
- 4
The digits of 42759 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 49 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42759 = 3^{2} \times 4751 \]42759 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 61776 |
| Euler totient φ(n) | 28500 |
| Square | 1828332081 |
| Cube | 78177651451479 |
| Square root | 206.782494 (= 3√4751) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 49 |
| Scientific notation | 4.2759 × |
42759 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand seven hundred and fifty-nine |
| Binary (base 2) | 1010011100000111 |
| Octal (base 8) | 123407 |
| Hexadecimal (base 16) | A707 |
| Base 3 | 2011122200 |
| As time | 42759 seconds = 11 h 52 min 39 s |
Is 42759 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 (42759 ÷ 3 = 14253) | 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 4) | 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 3) | 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 | Yes (42759 ÷ 9 = 4751) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 42759 a prime number?
No. 42759 = × 4751, so it is divisible by 3.
What are the factors of 42759?
1, 3, 9, 4751, 14253, 42759.
What is 42759 in binary?
1010011100000111 (hexadecimal A707, octal 123407).
What is the square root of 42759?
About 206.7825, exactly 3√4751.
Is 42759 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 42759?
It is a composite number with 6 divisors.