The number 42395
42395 is a composite number with 8 divisors. Its prime factorisation is 5 × 61 × 139. Divisors (8): 1, 5, 61, 139, 305, 695, 8479, 42395.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
42395 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
42395 is composite. Its prime factorisation is
- 3
The divisors add up to 52080; without 42395 itself that is 9685, so 42395 is deficient (9685 is less than 42395). Euler's totient φ(42395) = 33120 numbers up to 42395 share no factor with it.
- 4
The digits of 42395 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42395 = 5 \times 61 \times 139 \]
42395 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 52080 |
| Euler totient φ(n) | 33120 |
| Square | 1797336025 |
| Cube | 76198060779875 |
| Square root | 205.900461 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 88 |
| Scientific notation | 4.2395 × |
42395 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand three hundred and ninety-five |
| Binary (base 2) | 1010010110011011 |
| Octal (base 8) | 122633 |
| Hexadecimal (base 16) | A59B |
| Base 3 | 2011011012 |
| As time | 42395 seconds = 11 h 46 min 35 s |
Is 42395 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 | Yes (42395 ÷ 5 = 8479) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 42395 a prime number?
No. 42395 = 5 × 61 × 139, so it is divisible by 5.
What are the factors of 42395?
1, 5, 61, 139, 305, 695, 8479, 42395.
What is 42395 in binary?
1010010110011011 (hexadecimal A59B, octal 122633).
What is the square root of 42395?
About 205.9005.
Is 42395 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 42395?
It is a composite number with 8 divisors.