The number 93951
93951 is a composite number with 24 divisors. Its prime factorisation is × 11 × 13 × 73. Divisors (24): 1, 3, 9, 11, 13, 33, 39, 73, 99, 117, 143, 219, 429, 657, 803, 949 … 93951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93951 is composite. Its prime factorisation is
- 3
The divisors add up to 161616; without 93951 itself that is 67665, so 93951 is deficient (67665 is less than 93951). Euler's totient φ(93951) = 51840 numbers up to 93951 share no factor with it.
- 4
The digits of 93951 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93951 = 3^{2} \times 11 \times 13 \times 73 \]93951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 161616 |
| Euler totient φ(n) | 51840 |
| Square | 8826790401 |
| Cube | 829285784964351 |
| Square root | 306.514274 (= 3√10439) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 107 |
| Scientific notation | 9.3951 × |
93951 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and fifty-one |
| Binary (base 2) | 10110111011111111 |
| Octal (base 8) | 267377 |
| Hexadecimal (base 16) | 16EFF |
| Base 3 | 11202212200 |
| As time | 93951 seconds = 26 h 5 min 51 s |
Is 93951 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 (93951 ÷ 3 = 31317) | 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 | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (93951 ÷ 9 = 10439) | 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 | Yes (93951 ÷ 11 = 8541) | 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 93951 a prime number?
No. 93951 = × 11 × 13 × 73, so it is divisible by 3.
What are the factors of 93951?
1, 3, 9, 11, 13, 33, 39, 73, 99, 117, 143, 219, 429, 657, 803, 949, 1287, 2409, 2847, 7227, 8541, 10439, 31317, 93951.
What is 93951 in binary?
10110111011111111 (hexadecimal 16EFF, octal 267377).
What is the square root of 93951?
About 306.5143, exactly 3√10439.
Is 93951 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 93951?
It is a composite number with 24 divisors.