The number 93101
93101 is a binary palindrome (10110101110101101). Its prime factorisation is 157 × 593. Divisors (4): 1, 157, 593, 93101.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93101: a binary palindrome (10110101110101101); a semiprime: 157 × 593, the product of two primes.
- 2
93101 is composite. Its prime factorisation is
- 3
The divisors add up to 93852; without 93101 itself that is 751, so 93101 is deficient (751 is less than 93101). Euler's totient φ(93101) = 92352 numbers up to 93101 share no factor with it.
- 4
The digits of 93101 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93101 = 157 \times 593 \]
93101 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 93852 |
| Euler totient φ(n) | 92352 |
| Square | 8667796201 |
| Cube | 806980494109301 |
| Square root | 305.124565 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.3101 × |
93101 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand one hundred and one |
| Binary (base 2) | 10110101110101101 |
| Octal (base 8) | 265655 |
| Hexadecimal (base 16) | 16BAD |
| Base 3 | 11201201012 |
| As time | 93101 seconds = 25 h 51 min 41 s |
Is 93101 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 1) | 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 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 5) | 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 | No (remainder 8) | 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 93101 a prime number?
No. 93101 = 157 × 593, so it is divisible by 157.
What are the factors of 93101?
1, 157, 593, 93101.
What is 93101 in binary?
10110101110101101 (hexadecimal 16BAD, octal 265655).
What is the square root of 93101?
About 305.1246.
Is 93101 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 93101?
93101 is a binary palindrome (10110101110101101); a semiprime: 157 × 593, the product of two primes.