The number 91963
91963 is a composite number with 4 divisors. Its prime factorisation is 41 × 2243. Divisors (4): 1, 41, 2243, 91963.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91963: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 41 × 2243, the product of two primes.
- 2
91963 is composite. Its prime factorisation is
- 3
The divisors add up to 94248; without 91963 itself that is 2285, so 91963 is deficient (2285 is less than 91963). Euler's totient φ(91963) = 89680 numbers up to 91963 share no factor with it.
- 4
The digits of 91963 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 32 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91963 = 41 \times 2243 \]
91963 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 94248 |
| Euler totient φ(n) | 89680 |
| Square | 8457193369 |
| Cube | 777748873793347 |
| Square root | 303.254019 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 32 |
| Scientific notation | 9.1963 × |
91963 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand nine hundred and sixty-three |
| Binary (base 2) | 10110011100111011 |
| Octal (base 8) | 263473 |
| Hexadecimal (base 16) | 1673B |
| Base 3 | 11200011001 |
| As time | 91963 seconds = 25 h 32 min 43 s |
Is 91963 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91963 a prime number?
No. 91963 = 41 × 2243, so it is divisible by 41.
What are the factors of 91963?
1, 41, 2243, 91963.
What is 91963 in binary?
10110011100111011 (hexadecimal 1673B, octal 263473).
What is the square root of 91963?
About 303.2540.
Is 91963 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 91963?
91963 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 41 × 2243, the product of two primes.