The number 93249
93249 is a composite number with 12 divisors. Its prime factorisation is × 13 × 797. Divisors (12): 1, 3, 9, 13, 39, 117, 797, 2391, 7173, 10361, 31083, 93249.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93249 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93249 is composite. Its prime factorisation is
- 3
The divisors add up to 145236; without 93249 itself that is 51987, so 93249 is deficient (51987 is less than 93249). Euler's totient φ(93249) = 57312 numbers up to 93249 share no factor with it.
- 4
The digits of 93249 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93249 = 3^{2} \times 13 \times 797 \]93249 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 145236 |
| Euler totient φ(n) | 57312 |
| Square | 8695376001 |
| Cube | 810835116717249 |
| Square root | 305.366992 (= 3√10361) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.3249 × |
93249 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand two hundred and forty-nine |
| Binary (base 2) | 10110110001000001 |
| Octal (base 8) | 266101 |
| Hexadecimal (base 16) | 16C41 |
| Base 3 | 11201220200 |
| As time | 93249 seconds = 25 h 54 min 9 s |
Is 93249 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (93249 ÷ 3 = 31083) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (93249 ÷ 9 = 10361) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93249 a prime number?
No. 93249 = × 13 × 797, so it is divisible by 3.
What are the factors of 93249?
1, 3, 9, 13, 39, 117, 797, 2391, 7173, 10361, 31083, 93249.
What is 93249 in binary?
10110110001000001 (hexadecimal 16C41, octal 266101).
What is the square root of 93249?
About 305.3670, exactly 3√10361.
Is 93249 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 93249?
It is a composite number with 12 divisors.