The number 46852
46852 is a composite number with 24 divisors. Its prime factorisation is × 13 × 17 × 53. Divisors (24): 1, 2, 4, 13, 17, 26, 34, 52, 53, 68, 106, 212, 221, 442, 689, 884 … 46852.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46852 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46852 is composite. Its prime factorisation is
- 3
The divisors add up to 95256; without 46852 itself that is 48404, so 46852 is abundant (48404 is more than 46852). Euler's totient φ(46852) = 19968 numbers up to 46852 share no factor with it.
- 4
The digits of 46852 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46852 = 2^{2} \times 13 \times 17 \times 53 \]46852 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 95256 |
| Euler totient φ(n) | 19968 |
| Square | 2195109904 |
| Cube | 102845289222208 |
| Square root | 216.453228 (= 2√11713) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6852 × |
46852 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand eight hundred and fifty-two |
| Binary (base 2) | 1011011100000100 |
| Octal (base 8) | 133404 |
| Hexadecimal (base 16) | B704 |
| Base 3 | 2101021021 |
| As time | 46852 seconds = 13 h 0 min 52 s |
Is 46852 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46852 ÷ 2 = 23426) | 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 (46852 ÷ 4 = 11713) | 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 | No (remainder 1) | 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 3) | 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 46852 a prime number?
No. 46852 = × 13 × 17 × 53, so it is divisible by 2.
What are the factors of 46852?
1, 2, 4, 13, 17, 26, 34, 52, 53, 68, 106, 212, 221, 442, 689, 884, 901, 1378, 1802, 2756, 3604, 11713, 23426, 46852.
What is 46852 in binary?
1011011100000100 (hexadecimal B704, octal 133404).
What is the square root of 46852?
About 216.4532, exactly 2√11713.
Is 46852 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 46852?
It is a composite number with 24 divisors.