The number 46252
46252 is a composite number with 12 divisors. Its prime factorisation is × 31 × 373. Divisors (12): 1, 2, 4, 31, 62, 124, 373, 746, 1492, 11563, 23126, 46252.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46252 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46252 is composite. Its prime factorisation is
- 3
The divisors add up to 83776; without 46252 itself that is 37524, so 46252 is deficient (37524 is less than 46252). Euler's totient φ(46252) = 22320 numbers up to 46252 share no factor with it.
- 4
The digits of 46252 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46252 = 2^{2} \times 31 \times 373 \]46252 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 83776 |
| Euler totient φ(n) | 22320 |
| Square | 2139247504 |
| Cube | 98944475555008 |
| Square root | 215.062782 (= 2√11563) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6252 × |
46252 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand two hundred and fifty-two |
| Binary (base 2) | 1011010010101100 |
| Octal (base 8) | 132254 |
| Hexadecimal (base 16) | B4AC |
| Base 3 | 2100110001 |
| As time | 46252 seconds = 12 h 50 min 52 s |
Is 46252 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46252 ÷ 2 = 23126) | 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 (46252 ÷ 4 = 11563) | 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 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 1) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46252 a prime number?
No. 46252 = × 31 × 373, so it is divisible by 2.
What are the factors of 46252?
1, 2, 4, 31, 62, 124, 373, 746, 1492, 11563, 23126, 46252.
What is 46252 in binary?
1011010010101100 (hexadecimal B4AC, octal 132254).
What is the square root of 46252?
About 215.0628, exactly 2√11563.
Is 46252 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 46252?
It is a composite number with 12 divisors.