The number 93072
93072 is a composite number with 40 divisors. Its prime factorisation is × 3 × 7 × 277. Divisors (40): 1, 2, 3, 4, 6, 7, 8, 12, 14, 16, 21, 24, 28, 42, 48, 56 … 93072.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93072: a Harshad number: divisible by its digit sum 21.
- 2
93072 is composite. Its prime factorisation is
- 3
The divisors add up to 275776; without 93072 itself that is 182704, so 93072 is abundant (182704 is more than 93072). Euler's totient φ(93072) = 26496 numbers up to 93072 share no factor with it.
- 4
The digits of 93072 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93072 = 2^{4} \times 3 \times 7 \times 277 \]93072 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 275776 |
| Euler totient φ(n) | 26496 |
| Square | 8662397184 |
| Cube | 806226630709248 |
| Square root | 305.077039 (= 4√5817) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.3072 × |
93072 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand and seventy-two |
| Binary (base 2) | 10110101110010000 |
| Octal (base 8) | 265620 |
| Hexadecimal (base 16) | 16B90 |
| Base 3 | 11201200010 |
| As time | 93072 seconds = 25 h 51 min 12 s |
Is 93072 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93072 ÷ 2 = 46536) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (93072 ÷ 3 = 31024) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (93072 ÷ 4 = 23268) | 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 | Yes (93072 ÷ 6 = 15512) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (93072 ÷ 7 = 13296) | 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 (93072 ÷ 8 = 11634) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (93072 ÷ 12 = 7756) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93072 a prime number?
No. 93072 = × 3 × 7 × 277, so it is divisible by 2.
What are the factors of 93072?
1, 2, 3, 4, 6, 7, 8, 12, 14, 16, 21, 24, 28, 42, 48, 56, 84, 112, 168, 277, 336, 554, 831, 1108, 1662, 1939, 2216, 3324, 3878, 4432, 5817, 6648, 7756, 11634, 13296, 15512, 23268, 31024, 46536, 93072.
What is 93072 in binary?
10110101110010000 (hexadecimal 16B90, octal 265620).
What is the square root of 93072?
About 305.0770, exactly 4√5817.
Is 93072 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 93072?
93072 is a Harshad number: divisible by its digit sum 21.