The number 46532
46532 is a composite number with 6 divisors. Its prime factorisation is × 11633. Divisors (6): 1, 2, 4, 11633, 23266, 46532.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46532 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46532 is composite. Its prime factorisation is
- 3
The divisors add up to 81438; without 46532 itself that is 34906, so 46532 is deficient (34906 is less than 46532). Euler's totient φ(46532) = 23264 numbers up to 46532 share no factor with it.
- 4
The digits of 46532 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46532 = 2^{2} \times 11633 \]46532 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 81438 |
| Euler totient φ(n) | 23264 |
| Square | 2165227024 |
| Cube | 100752343880768 |
| Square root | 215.712772 (= 2√11633) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.6532 × |
46532 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand five hundred and thirty-two |
| Binary (base 2) | 1011010111000100 |
| Octal (base 8) | 132704 |
| Hexadecimal (base 16) | B5C4 |
| Base 3 | 2100211102 |
| As time | 46532 seconds = 12 h 55 min 32 s |
Is 46532 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46532 ÷ 2 = 23266) | 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 (46532 ÷ 4 = 11633) | 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 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 2) | 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 46532 a prime number?
No. 46532 = × 11633, so it is divisible by 2.
What are the factors of 46532?
1, 2, 4, 11633, 23266, 46532.
What is 46532 in binary?
1011010111000100 (hexadecimal B5C4, octal 132704).
What is the square root of 46532?
About 215.7128, exactly 2√11633.
Is 46532 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 46532?
It is a composite number with 6 divisors.