The number 90613
90613 is a composite number with 8 divisors. Its prime factorisation is 31 × 37 × 79. Divisors (8): 1, 31, 37, 79, 1147, 2449, 2923, 90613.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90613 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90613 is composite. Its prime factorisation is
- 3
The divisors add up to 97280; without 90613 itself that is 6667, so 90613 is deficient (6667 is less than 90613). Euler's totient φ(90613) = 84240 numbers up to 90613 share no factor with it.
- 4
The digits of 90613 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90613 = 31 \times 37 \times 79 \]
90613 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 97280 |
| Euler totient φ(n) | 84240 |
| Square | 8210715769 |
| Cube | 743997587976397 |
| Square root | 301.019933 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 89 |
| Scientific notation | 9.0613 × |
90613 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand six hundred and thirteen |
| Binary (base 2) | 10110000111110101 |
| Octal (base 8) | 260765 |
| Hexadecimal (base 16) | 161F5 |
| Base 3 | 11121022001 |
| As time | 90613 seconds = 25 h 10 min 13 s |
Is 90613 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 5) | 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 1) | 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 6) | 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 90613 a prime number?
No. 90613 = 31 × 37 × 79, so it is divisible by 31.
What are the factors of 90613?
1, 31, 37, 79, 1147, 2449, 2923, 90613.
What is 90613 in binary?
10110000111110101 (hexadecimal 161F5, octal 260765).
What is the square root of 90613?
About 301.0199.
Is 90613 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 90613?
It is a composite number with 8 divisors.