The number 93068
93068 is a composite number with 12 divisors. Its prime factorisation is × 53 × 439. Divisors (12): 1, 2, 4, 53, 106, 212, 439, 878, 1756, 23267, 46534, 93068.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93068: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
93068 is composite. Its prime factorisation is
- 3
The divisors add up to 166320; without 93068 itself that is 73252, so 93068 is deficient (73252 is less than 93068). Euler's totient φ(93068) = 45552 numbers up to 93068 share no factor with it.
- 4
The digits of 93068 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93068 = 2^{2} \times 53 \times 439 \]93068 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 166320 |
| Euler totient φ(n) | 45552 |
| Square | 8661652624 |
| Cube | 806122686410432 |
| Square root | 305.070484 (= 2√23267) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.3068 × |
93068 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand and sixty-eight |
| Binary (base 2) | 10110101110001100 |
| Octal (base 8) | 265614 |
| Hexadecimal (base 16) | 16B8C |
| Base 3 | 11201122222 |
| As time | 93068 seconds = 25 h 51 min 8 s |
Is 93068 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93068 ÷ 2 = 46534) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (93068 ÷ 4 = 23267) | 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 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 8) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93068 a prime number?
No. 93068 = × 53 × 439, so it is divisible by 2.
What are the factors of 93068?
1, 2, 4, 53, 106, 212, 439, 878, 1756, 23267, 46534, 93068.
What is 93068 in binary?
10110101110001100 (hexadecimal 16B8C, octal 265614).
What is the square root of 93068?
About 305.0705, exactly 2√23267.
Is 93068 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 93068?
93068 is a happy number: repeatedly adding the squares of its digits reaches 1.