The number 92913
92913 is a composite number with 4 divisors. Its prime factorisation is 3 × 30971. Divisors (4): 1, 3, 30971, 92913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 92913: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 30971, the product of two primes.
- 2
92913 is composite. Its prime factorisation is
- 3
The divisors add up to 123888; without 92913 itself that is 30975, so 92913 is deficient (30975 is less than 92913). Euler's totient φ(92913) = 61940 numbers up to 92913 share no factor with it.
- 4
The digits of 92913 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92913 = 3 \times 30971 \]
92913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 123888 |
| Euler totient φ(n) | 61940 |
| Square | 8632825569 |
| Cube | 802101722092497 |
| Square root | 304.816338 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.2913 × |
92913 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand nine hundred and thirteen |
| Binary (base 2) | 10110101011110001 |
| Octal (base 8) | 265361 |
| Hexadecimal (base 16) | 16AF1 |
| Base 3 | 11201110020 |
| As time | 92913 seconds = 25 h 48 min 33 s |
Is 92913 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 (92913 ÷ 3 = 30971) | 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 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 1) | 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 7) | 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 92913 a prime number?
No. 92913 = 3 × 30971, so it is divisible by 3.
What are the factors of 92913?
1, 3, 30971, 92913.
What is 92913 in binary?
10110101011110001 (hexadecimal 16AF1, octal 265361).
What is the square root of 92913?
About 304.8163.
Is 92913 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 92913?
92913 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 30971, the product of two primes.