The number 92013
92013 is a composite number with 4 divisors. Its prime factorisation is 3 × 30671. Divisors (4): 1, 3, 30671, 92013.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 92013: a semiprime: 3 × 30671, the product of two primes.
- 2
92013 is composite. Its prime factorisation is
- 3
The divisors add up to 122688; without 92013 itself that is 30675, so 92013 is deficient (30675 is less than 92013). Euler's totient φ(92013) = 61340 numbers up to 92013 share no factor with it.
- 4
The digits of 92013 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92013 = 3 \times 30671 \]
92013 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 122688 |
| Euler totient φ(n) | 61340 |
| Square | 8466392169 |
| Cube | 779018142646197 |
| Square root | 303.336447 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.2013 × |
92013 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand and thirteen |
| Binary (base 2) | 10110011101101101 |
| Octal (base 8) | 263555 |
| Hexadecimal (base 16) | 1676D |
| Base 3 | 11200012220 |
| As time | 92013 seconds = 25 h 33 min 33 s |
Is 92013 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 (92013 ÷ 3 = 30671) | 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 3) | 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 6) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 92013 a prime number?
No. 92013 = 3 × 30671, so it is divisible by 3.
What are the factors of 92013?
1, 3, 30671, 92013.
What is 92013 in binary?
10110011101101101 (hexadecimal 1676D, octal 263555).
What is the square root of 92013?
About 303.3364.
Is 92013 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 92013?
92013 is a semiprime: 3 × 30671, the product of two primes.