The number 91059
91059 is a composite number with 8 divisors. Its prime factorisation is 3 × 127 × 239. Divisors (8): 1, 3, 127, 239, 381, 717, 30353, 91059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91059: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
91059 is composite. Its prime factorisation is
- 3
The divisors add up to 122880; without 91059 itself that is 31821, so 91059 is deficient (31821 is less than 91059). Euler's totient φ(91059) = 59976 numbers up to 91059 share no factor with it.
- 4
The digits of 91059 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 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91059 = 3 \times 127 \times 239 \]
91059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 122880 |
| Euler totient φ(n) | 59976 |
| Square | 8291741481 |
| Cube | 755037687518379 |
| Square root | 301.759838 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.1059 × |
91059 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and fifty-nine |
| Binary (base 2) | 10110001110110011 |
| Octal (base 8) | 261663 |
| Hexadecimal (base 16) | 163B3 |
| Base 3 | 11121220120 |
| As time | 91059 seconds = 25 h 17 min 39 s |
Is 91059 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 (91059 ÷ 3 = 30353) | 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 4) | 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 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 3) | 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 9) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91059 a prime number?
No. 91059 = 3 × 127 × 239, so it is divisible by 3.
What are the factors of 91059?
1, 3, 127, 239, 381, 717, 30353, 91059.
What is 91059 in binary?
10110001110110011 (hexadecimal 163B3, octal 261663).
What is the square root of 91059?
About 301.7598.
Is 91059 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 91059?
91059 is a happy number: repeatedly adding the squares of its digits reaches 1.