The number 9263
9263 is a composite number with 4 divisors. Its prime factorisation is 59 × 157. Divisors (4): 1, 59, 157, 9263.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9263: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 59 × 157, the product of two primes.
- 2
9263 is composite. Its prime factorisation is
- 3
The divisors add up to 9480; without 9263 itself that is 217, so 9263 is deficient (217 is less than 9263). Euler's totient φ(9263) = 9048 numbers up to 9263 share no factor with it.
- 4
The digits of 9263 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9263 = 59 \times 157 \]
9263 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 9480 |
| Euler totient φ(n) | 9048 |
| Square | 85803169 |
| Cube | 794794754447 |
| Square root | 96.244480 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 140 |
| Scientific notation | 9.263 × |
9263 in other forms
| Form | Value |
|---|---|
| In words | nine thousand two hundred and sixty-three |
| Binary (base 2) | 10010000101111 |
| Octal (base 8) | 22057 |
| Hexadecimal (base 16) | 242F |
| Base 3 | 110201002 |
| As time | 9263 seconds = 2 h 34 min 23 s |
Is 9263 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9263 a prime number?
No. 9263 = 59 × 157, so it is divisible by 59.
What are the factors of 9263?
1, 59, 157, 9263.
What is 9263 in binary?
10010000101111 (hexadecimal 242F, octal 22057).
What is the square root of 9263?
About 96.2445.
Is 9263 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 9263?
9263 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 59 × 157, the product of two primes.