The number 46052
46052 is a composite number with 12 divisors. Its prime factorisation is × 29 × 397. Divisors (12): 1, 2, 4, 29, 58, 116, 397, 794, 1588, 11513, 23026, 46052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46052 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46052 is composite. Its prime factorisation is
- 3
The divisors add up to 83580; without 46052 itself that is 37528, so 46052 is deficient (37528 is less than 46052). Euler's totient φ(46052) = 22176 numbers up to 46052 share no factor with it.
- 4
The digits of 46052 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46052 = 2^{2} \times 29 \times 397 \]46052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 83580 |
| Euler totient φ(n) | 22176 |
| Square | 2120786704 |
| Cube | 97666469292608 |
| Square root | 214.597297 (= 2√11513) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 176 |
| Scientific notation | 4.6052 × |
46052 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand and fifty-two |
| Binary (base 2) | 1011001111100100 |
| Octal (base 8) | 131744 |
| Hexadecimal (base 16) | B3E4 |
| Base 3 | 2100011122 |
| As time | 46052 seconds = 12 h 47 min 32 s |
Is 46052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46052 ÷ 2 = 23026) | 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 (46052 ÷ 4 = 11513) | 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 6) | 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 8) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46052 a prime number?
No. 46052 = × 29 × 397, so it is divisible by 2.
What are the factors of 46052?
1, 2, 4, 29, 58, 116, 397, 794, 1588, 11513, 23026, 46052.
What is 46052 in binary?
1011001111100100 (hexadecimal B3E4, octal 131744).
What is the square root of 46052?
About 214.5973, exactly 2√11513.
Is 46052 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 46052?
It is a composite number with 12 divisors.