The number 93929
93929 is a composite number with 4 divisors. Its prime factorisation is 11 × 8539. Divisors (4): 1, 11, 8539, 93929.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93929: a semiprime: 11 × 8539, the product of two primes.
- 2
93929 is composite. Its prime factorisation is
- 3
The divisors add up to 102480; without 93929 itself that is 8551, so 93929 is deficient (8551 is less than 93929). Euler's totient φ(93929) = 85380 numbers up to 93929 share no factor with it.
- 4
The digits of 93929 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93929 = 11 \times 8539 \]
93929 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 102480 |
| Euler totient φ(n) | 85380 |
| Square | 8822657041 |
| Cube | 828703353204089 |
| Square root | 306.478384 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 107 |
| Scientific notation | 9.3929 × |
93929 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and twenty-nine |
| Binary (base 2) | 10110111011101001 |
| Octal (base 8) | 267351 |
| Hexadecimal (base 16) | 16EE9 |
| Base 3 | 11202211212 |
| As time | 93929 seconds = 26 h 5 min 29 s |
Is 93929 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 4) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 | Yes (93929 ÷ 11 = 8539) | 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 93929 a prime number?
No. 93929 = 11 × 8539, so it is divisible by 11.
What are the factors of 93929?
1, 11, 8539, 93929.
What is 93929 in binary?
10110111011101001 (hexadecimal 16EE9, octal 267351).
What is the square root of 93929?
About 306.4784.
Is 93929 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 93929?
93929 is a semiprime: 11 × 8539, the product of two primes.