The number 93953
93953 is a composite number with 4 divisors. Its prime factorisation is 47 × 1999. Divisors (4): 1, 47, 1999, 93953.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93953: a semiprime: 47 × 1999, the product of two primes.
- 2
93953 is composite. Its prime factorisation is
- 3
The divisors add up to 96000; without 93953 itself that is 2047, so 93953 is deficient (2047 is less than 93953). Euler's totient φ(93953) = 91908 numbers up to 93953 share no factor with it.
- 4
The digits of 93953 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 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93953 = 47 \times 1999 \]
93953 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 96000 |
| Euler totient φ(n) | 91908 |
| Square | 8827166209 |
| Cube | 829338746834177 |
| Square root | 306.517536 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.3953 × |
93953 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand nine hundred and fifty-three |
| Binary (base 2) | 10110111100000001 |
| Octal (base 8) | 267401 |
| Hexadecimal (base 16) | 16F01 |
| Base 3 | 11202212202 |
| As time | 93953 seconds = 26 h 5 min 53 s |
Is 93953 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 3) | 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 6) | 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 3) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93953 a prime number?
No. 93953 = 47 × 1999, so it is divisible by 47.
What are the factors of 93953?
1, 47, 1999, 93953.
What is 93953 in binary?
10110111100000001 (hexadecimal 16F01, octal 267401).
What is the square root of 93953?
About 306.5175.
Is 93953 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 93953?
93953 is a semiprime: 47 × 1999, the product of two primes.