The number 92053
92053 is a composite number with 8 divisors. Its prime factorisation is 13 × 73 × 97. Divisors (8): 1, 13, 73, 97, 949, 1261, 7081, 92053.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
92053 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
92053 is composite. Its prime factorisation is
- 3
The divisors add up to 101528; without 92053 itself that is 9475, so 92053 is deficient (9475 is less than 92053). Euler's totient φ(92053) = 82944 numbers up to 92053 share no factor with it.
- 4
The digits of 92053 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 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92053 = 13 \times 73 \times 97 \]
92053 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 101528 |
| Euler totient φ(n) | 82944 |
| Square | 8473754809 |
| Cube | 780034551432877 |
| Square root | 303.402373 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.2053 × |
92053 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand and fifty-three |
| Binary (base 2) | 10110011110010101 |
| Octal (base 8) | 263625 |
| Hexadecimal (base 16) | 16795 |
| Base 3 | 11200021101 |
| As time | 92053 seconds = 25 h 34 min 13 s |
Is 92053 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 3) | 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 5) | 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 92053 a prime number?
No. 92053 = 13 × 73 × 97, so it is divisible by 13.
What are the factors of 92053?
1, 13, 73, 97, 949, 1261, 7081, 92053.
What is 92053 in binary?
10110011110010101 (hexadecimal 16795, octal 263625).
What is the square root of 92053?
About 303.4024.
Is 92053 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 92053?
It is a composite number with 8 divisors.