The number 40532
40532 is a composite number with 6 divisors. Its prime factorisation is × 10133. Divisors (6): 1, 2, 4, 10133, 20266, 40532.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
40532 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
40532 is composite. Its prime factorisation is
- 3
The divisors add up to 70938; without 40532 itself that is 30406, so 40532 is deficient (30406 is less than 40532). Euler's totient φ(40532) = 20264 numbers up to 40532 share no factor with it.
- 4
The digits of 40532 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 36 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40532 = 2^{2} \times 10133 \]40532 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 70938 |
| Euler totient φ(n) | 20264 |
| Square | 1642843024 |
| Cube | 66587713448768 |
| Square root | 201.325607 (= 2√10133) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 36 |
| Scientific notation | 4.0532 × |
40532 in other forms
| Form | Value |
|---|---|
| In words | forty thousand five hundred and thirty-two |
| Binary (base 2) | 1001111001010100 |
| Octal (base 8) | 117124 |
| Hexadecimal (base 16) | 9E54 |
| Base 3 | 2001121012 |
| As time | 40532 seconds = 11 h 15 min 32 s |
Is 40532 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (40532 ÷ 2 = 20266) | 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 | Yes (40532 ÷ 4 = 10133) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 5) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40532 a prime number?
No. 40532 = × 10133, so it is divisible by 2.
What are the factors of 40532?
1, 2, 4, 10133, 20266, 40532.
What is 40532 in binary?
1001111001010100 (hexadecimal 9E54, octal 117124).
What is the square root of 40532?
About 201.3256, exactly 2√10133.
Is 40532 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 40532?
It is a composite number with 6 divisors.