The number 93048
93048 is a composite number with 16 divisors. Its prime factorisation is × 3 × 3877. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 3877, 7754, 11631, 15508, 23262, 31016, 46524, 93048.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93048: a Harshad number: divisible by its digit sum 24.
- 2
93048 is composite. Its prime factorisation is
- 3
The divisors add up to 232680; without 93048 itself that is 139632, so 93048 is abundant (139632 is more than 93048). Euler's totient φ(93048) = 31008 numbers up to 93048 share no factor with it.
- 4
The digits of 93048 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93048 = 2^{3} \times 3 \times 3877 \]93048 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 232680 |
| Euler totient φ(n) | 31008 |
| Square | 8657930304 |
| Cube | 805603098926592 |
| Square root | 305.037703 (= 2√23262) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.3048 × |
93048 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand and forty-eight |
| Binary (base 2) | 10110101101111000 |
| Octal (base 8) | 265570 |
| Hexadecimal (base 16) | 16B78 |
| Base 3 | 11201122020 |
| As time | 93048 seconds = 25 h 50 min 48 s |
Is 93048 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93048 ÷ 2 = 46524) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (93048 ÷ 3 = 31016) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (93048 ÷ 4 = 23262) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (93048 ÷ 6 = 15508) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | Yes (93048 ÷ 8 = 11631) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (93048 ÷ 12 = 7754) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93048 a prime number?
No. 93048 = × 3 × 3877, so it is divisible by 2.
What are the factors of 93048?
1, 2, 3, 4, 6, 8, 12, 24, 3877, 7754, 11631, 15508, 23262, 31016, 46524, 93048.
What is 93048 in binary?
10110101101111000 (hexadecimal 16B78, octal 265570).
What is the square root of 93048?
About 305.0377, exactly 2√23262.
Is 93048 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 93048?
93048 is a Harshad number: divisible by its digit sum 24.