The number 93881
93881 is a composite number with 4 divisors. Its prime factorisation is 269 × 349. Divisors (4): 1, 269, 349, 93881.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93881: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 269 × 349, the product of two primes.
- 2
93881 is composite. Its prime factorisation is
- 3
The divisors add up to 94500; without 93881 itself that is 619, so 93881 is deficient (619 is less than 93881). Euler's totient φ(93881) = 93264 numbers up to 93881 share no factor with it.
- 4
The digits of 93881 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93881 = 269 \times 349 \]
93881 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 94500 |
| Euler totient φ(n) | 93264 |
| Square | 8813642161 |
| Cube | 827433539716841 |
| Square root | 306.400065 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 107 |
| Scientific notation | 9.3881 × |
93881 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand eight hundred and eighty-one |
| Binary (base 2) | 10110111010111001 |
| Octal (base 8) | 267271 |
| Hexadecimal (base 16) | 16EB9 |
| Base 3 | 11202210002 |
| As time | 93881 seconds = 26 h 4 min 41 s |
Is 93881 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 | No (remainder 2) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93881 a prime number?
No. 93881 = 269 × 349, so it is divisible by 269.
What are the factors of 93881?
1, 269, 349, 93881.
What is 93881 in binary?
10110111010111001 (hexadecimal 16EB9, octal 267271).
What is the square root of 93881?
About 306.4001.
Is 93881 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 93881?
93881 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 269 × 349, the product of two primes.