The number 93891
93891 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 17 × 263. Divisors (16): 1, 3, 7, 17, 21, 51, 119, 263, 357, 789, 1841, 4471, 5523, 13413, 31297, 93891.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93891: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
93891 is composite. Its prime factorisation is
- 3
The divisors add up to 152064; without 93891 itself that is 58173, so 93891 is deficient (58173 is less than 93891). Euler's totient φ(93891) = 50304 numbers up to 93891 share no factor with it.
- 4
The digits of 93891 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 159 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93891 = 3 \times 7 \times 17 \times 263 \]
93891 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 152064 |
| Euler totient φ(n) | 50304 |
| Square | 8815519881 |
| Cube | 827697977146971 |
| Square root | 306.416383 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 159 |
| Scientific notation | 9.3891 × |
93891 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand eight hundred and ninety-one |
| Binary (base 2) | 10110111011000011 |
| Octal (base 8) | 267303 |
| Hexadecimal (base 16) | 16EC3 |
| Base 3 | 11202210110 |
| As time | 93891 seconds = 26 h 4 min 51 s |
Is 93891 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 (93891 ÷ 3 = 31297) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (93891 ÷ 7 = 13413) | 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93891 a prime number?
No. 93891 = 3 × 7 × 17 × 263, so it is divisible by 3.
What are the factors of 93891?
1, 3, 7, 17, 21, 51, 119, 263, 357, 789, 1841, 4471, 5523, 13413, 31297, 93891.
What is 93891 in binary?
10110111011000011 (hexadecimal 16EC3, octal 267303).
What is the square root of 93891?
About 306.4164.
Is 93891 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 93891?
93891 is a happy number: repeatedly adding the squares of its digits reaches 1.