The number 91067
91067 is a composite number with 4 divisors. Its prime factorisation is 19 × 4793. Divisors (4): 1, 19, 4793, 91067.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91067: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 19 × 4793, the product of two primes.
- 2
91067 is composite. Its prime factorisation is
- 3
The divisors add up to 95880; without 91067 itself that is 4813, so 91067 is deficient (4813 is less than 91067). Euler's totient φ(91067) = 86256 numbers up to 91067 share no factor with it.
- 4
The digits of 91067 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91067 = 19 \times 4793 \]
91067 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 95880 |
| Euler totient φ(n) | 86256 |
| Square | 8293198489 |
| Cube | 755236706797763 |
| Square root | 301.773094 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.1067 × |
91067 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and sixty-seven |
| Binary (base 2) | 10110001110111011 |
| Octal (base 8) | 261673 |
| Hexadecimal (base 16) | 163BB |
| Base 3 | 11121220212 |
| As time | 91067 seconds = 25 h 17 min 47 s |
Is 91067 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 2) | 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 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91067 a prime number?
No. 91067 = 19 × 4793, so it is divisible by 19.
What are the factors of 91067?
1, 19, 4793, 91067.
What is 91067 in binary?
10110001110111011 (hexadecimal 163BB, octal 261673).
What is the square root of 91067?
About 301.7731.
Is 91067 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 91067?
91067 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 19 × 4793, the product of two primes.