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