The number 93046
93046 is a composite number with 4 divisors. Its prime factorisation is 2 × 46523. Divisors (4): 1, 2, 46523, 93046.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93046: a semiprime: 2 × 46523, the product of two primes.
- 2
93046 is composite. Its prime factorisation is
- 3
The divisors add up to 139572; without 93046 itself that is 46526, so 93046 is deficient (46526 is less than 93046). Euler's totient φ(93046) = 46522 numbers up to 93046 share no factor with it.
- 4
The digits of 93046 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93046 = 2 \times 46523 \]
93046 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 139572 |
| Euler totient φ(n) | 46522 |
| Square | 8657558116 |
| Cube | 805551152461336 |
| Square root | 305.034424 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.3046 × |
93046 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand and forty-six |
| Binary (base 2) | 10110101101110110 |
| Octal (base 8) | 265566 |
| Hexadecimal (base 16) | 16B76 |
| Base 3 | 11201122011 |
| As time | 93046 seconds = 25 h 50 min 46 s |
Is 93046 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93046 ÷ 2 = 46523) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93046 a prime number?
No. 93046 = 2 × 46523, so it is divisible by 2.
What are the factors of 93046?
1, 2, 46523, 93046.
What is 93046 in binary?
10110101101110110 (hexadecimal 16B76, octal 265566).
What is the square root of 93046?
About 305.0344.
Is 93046 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 93046?
93046 is a semiprime: 2 × 46523, the product of two primes.