The number 42532
42532 is a composite number with 24 divisors. Its prime factorisation is × × 31. Divisors (24): 1, 2, 4, 7, 14, 28, 31, 49, 62, 98, 124, 196, 217, 343, 434, 686 … 42532.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
42532 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
42532 is composite. Its prime factorisation is
- 3
The divisors add up to 89600; without 42532 itself that is 47068, so 42532 is abundant (47068 is more than 42532). Euler's totient φ(42532) = 17640 numbers up to 42532 share no factor with it.
- 4
The digits of 42532 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 150 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42532 = 2^{2} \times 7^{3} \times 31 \]42532 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 89600 |
| Euler totient φ(n) | 17640 |
| Square | 1808971024 |
| Cube | 76939155592768 |
| Square root | 206.232878 (= 14√217) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 150 |
| Scientific notation | 4.2532 × |
42532 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand five hundred and thirty-two |
| Binary (base 2) | 1010011000100100 |
| Octal (base 8) | 123044 |
| Hexadecimal (base 16) | A624 |
| Base 3 | 2011100021 |
| As time | 42532 seconds = 11 h 48 min 52 s |
Is 42532 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (42532 ÷ 2 = 21266) | 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 | Yes (42532 ÷ 4 = 10633) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (42532 ÷ 7 = 6076) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 42532 a prime number?
No. 42532 = × × 31, so it is divisible by 2.
What are the factors of 42532?
1, 2, 4, 7, 14, 28, 31, 49, 62, 98, 124, 196, 217, 343, 434, 686, 868, 1372, 1519, 3038, 6076, 10633, 21266, 42532.
What is 42532 in binary?
1010011000100100 (hexadecimal A624, octal 123044).
What is the square root of 42532?
About 206.2329, exactly 14√217.
Is 42532 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 42532?
It is a composite number with 24 divisors.