The number 93052
93052 is a composite number with 12 divisors. Its prime factorisation is × 43 × 541. Divisors (12): 1, 2, 4, 43, 86, 172, 541, 1082, 2164, 23263, 46526, 93052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93052 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93052 is composite. Its prime factorisation is
- 3
The divisors add up to 166936; without 93052 itself that is 73884, so 93052 is deficient (73884 is less than 93052). Euler's totient φ(93052) = 45360 numbers up to 93052 share no factor with it.
- 4
The digits of 93052 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 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93052 = 2^{2} \times 43 \times 541 \]93052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 166936 |
| Euler totient φ(n) | 45360 |
| Square | 8658674704 |
| Cube | 805706998556608 |
| Square root | 305.044259 (= 2√23263) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.3052 × |
93052 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand and fifty-two |
| Binary (base 2) | 10110101101111100 |
| Octal (base 8) | 265574 |
| Hexadecimal (base 16) | 16B7C |
| Base 3 | 11201122101 |
| As time | 93052 seconds = 25 h 50 min 52 s |
Is 93052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93052 ÷ 2 = 46526) | 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 (93052 ÷ 4 = 23263) | 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 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 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 93052 a prime number?
No. 93052 = × 43 × 541, so it is divisible by 2.
What are the factors of 93052?
1, 2, 4, 43, 86, 172, 541, 1082, 2164, 23263, 46526, 93052.
What is 93052 in binary?
10110101101111100 (hexadecimal 16B7C, octal 265574).
What is the square root of 93052?
About 305.0443, exactly 2√23263.
Is 93052 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 93052?
It is a composite number with 12 divisors.