The number 93909
93909 is a composite number with 8 divisors. Its prime factorisation is 3 × 23 × 1361. Divisors (8): 1, 3, 23, 69, 1361, 4083, 31303, 93909.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93909 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93909 is composite. Its prime factorisation is
- 3
The divisors add up to 130752; without 93909 itself that is 36843, so 93909 is deficient (36843 is less than 93909). Euler's totient φ(93909) = 59840 numbers up to 93909 share no factor with it.
- 4
The digits of 93909 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 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93909 = 3 \times 23 \times 1361 \]
93909 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 130752 |
| Euler totient φ(n) | 59840 |
| Square | 8818900281 |
| Cube | 828174106488429 |
| Square root | 306.445754 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.3909 × |
93909 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and nine |
| Binary (base 2) | 10110111011010101 |
| Octal (base 8) | 267325 |
| Hexadecimal (base 16) | 16ED5 |
| Base 3 | 11202211010 |
| As time | 93909 seconds = 26 h 5 min 9 s |
Is 93909 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 (93909 ÷ 3 = 31303) | 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 3) | 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 5) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93909 a prime number?
No. 93909 = 3 × 23 × 1361, so it is divisible by 3.
What are the factors of 93909?
1, 3, 23, 69, 1361, 4083, 31303, 93909.
What is 93909 in binary?
10110111011010101 (hexadecimal 16ED5, octal 267325).
What is the square root of 93909?
About 306.4458.
Is 93909 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 93909?
It is a composite number with 8 divisors.