The number 46352
46352 is a composite number with 10 divisors. Its prime factorisation is × 2897. Divisors (10): 1, 2, 4, 8, 16, 2897, 5794, 11588, 23176, 46352.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46352 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46352 is composite. Its prime factorisation is
- 3
The divisors add up to 89838; without 46352 itself that is 43486, so 46352 is deficient (43486 is less than 46352). Euler's totient φ(46352) = 23168 numbers up to 46352 share no factor with it.
- 4
The digits of 46352 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 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46352 = 2^{4} \times 2897 \]46352 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 89838 |
| Euler totient φ(n) | 23168 |
| Square | 2148507904 |
| Cube | 99587638366208 |
| Square root | 215.295146 (= 4√2897) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6352 × |
46352 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand three hundred and fifty-two |
| Binary (base 2) | 1011010100010000 |
| Octal (base 8) | 132420 |
| Hexadecimal (base 16) | B510 |
| Base 3 | 2100120202 |
| As time | 46352 seconds = 12 h 52 min 32 s |
Is 46352 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46352 ÷ 2 = 23176) | 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 (46352 ÷ 4 = 11588) | 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 5) | 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 | Yes (46352 ÷ 8 = 5794) | 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 9) | 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 46352 a prime number?
No. 46352 = × 2897, so it is divisible by 2.
What are the factors of 46352?
1, 2, 4, 8, 16, 2897, 5794, 11588, 23176, 46352.
What is 46352 in binary?
1011010100010000 (hexadecimal B510, octal 132420).
What is the square root of 46352?
About 215.2951, exactly 4√2897.
Is 46352 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 46352?
It is a composite number with 10 divisors.