The number 91053
91053 is a composite number with 12 divisors. Its prime factorisation is × 67 × 151. Divisors (12): 1, 3, 9, 67, 151, 201, 453, 603, 1359, 10117, 30351, 91053.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91053 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91053 is composite. Its prime factorisation is
- 3
The divisors add up to 134368; without 91053 itself that is 43315, so 91053 is deficient (43315 is less than 91053). Euler's totient φ(91053) = 59400 numbers up to 91053 share no factor with it.
- 4
The digits of 91053 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 208 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91053 = 3^{2} \times 67 \times 151 \]91053 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 134368 |
| Euler totient φ(n) | 59400 |
| Square | 8290648809 |
| Cube | 754888446005877 |
| Square root | 301.749896 (= 3√10117) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 208 |
| Scientific notation | 9.1053 × |
91053 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and fifty-three |
| Binary (base 2) | 10110001110101101 |
| Octal (base 8) | 261655 |
| Hexadecimal (base 16) | 163AD |
| Base 3 | 11121220100 |
| As time | 91053 seconds = 25 h 17 min 33 s |
Is 91053 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 (91053 ÷ 3 = 30351) | 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 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (91053 ÷ 9 = 10117) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91053 a prime number?
No. 91053 = × 67 × 151, so it is divisible by 3.
What are the factors of 91053?
1, 3, 9, 67, 151, 201, 453, 603, 1359, 10117, 30351, 91053.
What is 91053 in binary?
10110001110101101 (hexadecimal 163AD, octal 261655).
What is the square root of 91053?
About 301.7499, exactly 3√10117.
Is 91053 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 91053?
It is a composite number with 12 divisors.