The number 93613
93613 is a composite number with 8 divisors. Its prime factorisation is 13 × 19 × 379. Divisors (8): 1, 13, 19, 247, 379, 4927, 7201, 93613.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93613 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93613 is composite. Its prime factorisation is
- 3
The divisors add up to 106400; without 93613 itself that is 12787, so 93613 is deficient (12787 is less than 93613). Euler's totient φ(93613) = 81648 numbers up to 93613 share no factor with it.
- 4
The digits of 93613 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93613 = 13 \times 19 \times 379 \]
93613 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 106400 |
| Euler totient φ(n) | 81648 |
| Square | 8763393769 |
| Cube | 820367580897397 |
| Square root | 305.962416 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.3613 × |
93613 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand six hundred and thirteen |
| Binary (base 2) | 10110110110101101 |
| Octal (base 8) | 266655 |
| Hexadecimal (base 16) | 16DAD |
| Base 3 | 11202102011 |
| As time | 93613 seconds = 26 h 0 min 13 s |
Is 93613 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 3) | 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 2) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 93613 a prime number?
No. 93613 = 13 × 19 × 379, so it is divisible by 13.
What are the factors of 93613?
1, 13, 19, 247, 379, 4927, 7201, 93613.
What is 93613 in binary?
10110110110101101 (hexadecimal 16DAD, octal 266655).
What is the square root of 93613?
About 305.9624.
Is 93613 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 93613?
It is a composite number with 8 divisors.