The number 42363
42363 is a composite number with 10 divisors. Its prime factorisation is × 523. Divisors (10): 1, 3, 9, 27, 81, 523, 1569, 4707, 14121, 42363.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
42363 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
42363 is composite. Its prime factorisation is
- 3
The divisors add up to 63404; without 42363 itself that is 21041, so 42363 is deficient (21041 is less than 42363). Euler's totient φ(42363) = 28188 numbers up to 42363 share no factor with it.
- 4
The digits of 42363 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 150 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42363 = 3^{4} \times 523 \]42363 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 63404 |
| Euler totient φ(n) | 28188 |
| Square | 1794623769 |
| Cube | 76025646726147 |
| Square root | 205.822739 (= 9√523) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 150 |
| Scientific notation | 4.2363 × |
42363 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand three hundred and sixty-three |
| Binary (base 2) | 1010010101111011 |
| Octal (base 8) | 122573 |
| Hexadecimal (base 16) | A57B |
| Base 3 | 2011010000 |
| As time | 42363 seconds = 11 h 46 min 3 s |
Is 42363 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 (42363 ÷ 3 = 14121) | 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 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (42363 ÷ 9 = 4707) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 42363 a prime number?
No. 42363 = × 523, so it is divisible by 3.
What are the factors of 42363?
1, 3, 9, 27, 81, 523, 1569, 4707, 14121, 42363.
What is 42363 in binary?
1010010101111011 (hexadecimal A57B, octal 122573).
What is the square root of 42363?
About 205.8227, exactly 9√523.
Is 42363 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 42363?
It is a composite number with 10 divisors.