The number 93069
93069 is a composite number with 12 divisors. Its prime factorisation is × 383. Divisors (12): 1, 3, 9, 27, 81, 243, 383, 1149, 3447, 10341, 31023, 93069.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93069: a Harshad number: divisible by its digit sum 27.
- 2
93069 is composite. Its prime factorisation is
- 3
The divisors add up to 139776; without 93069 itself that is 46707, so 93069 is deficient (46707 is less than 93069). Euler's totient φ(93069) = 61884 numbers up to 93069 share no factor with it.
- 4
The digits of 93069 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 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93069 = 3^{5} \times 383 \]93069 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 139776 |
| Euler totient φ(n) | 61884 |
| Square | 8661838761 |
| Cube | 806148671647509 |
| Square root | 305.072123 (= 9√1149) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.3069 × |
93069 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand and sixty-nine |
| Binary (base 2) | 10110101110001101 |
| Octal (base 8) | 265615 |
| Hexadecimal (base 16) | 16B8D |
| Base 3 | 11201200000 |
| As time | 93069 seconds = 25 h 51 min 9 s |
Is 93069 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 (93069 ÷ 3 = 31023) | 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 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 | No (remainder 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (93069 ÷ 9 = 10341) | 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 9) | 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 93069 a prime number?
No. 93069 = × 383, so it is divisible by 3.
What are the factors of 93069?
1, 3, 9, 27, 81, 243, 383, 1149, 3447, 10341, 31023, 93069.
What is 93069 in binary?
10110101110001101 (hexadecimal 16B8D, octal 265615).
What is the square root of 93069?
About 305.0721, exactly 9√1149.
Is 93069 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 93069?
93069 is a Harshad number: divisible by its digit sum 27.