The number 91012
91012 is a composite number with 12 divisors. Its prime factorisation is × 61 × 373. Divisors (12): 1, 2, 4, 61, 122, 244, 373, 746, 1492, 22753, 45506, 91012.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
91012 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
91012 is composite. Its prime factorisation is
- 3
The divisors add up to 162316; without 91012 itself that is 71304, so 91012 is deficient (71304 is less than 91012). Euler's totient φ(91012) = 44640 numbers up to 91012 share no factor with it.
- 4
The digits of 91012 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91012 = 2^{2} \times 61 \times 373 \]91012 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 162316 |
| Euler totient φ(n) | 44640 |
| Square | 8283184144 |
| Cube | 753869155313728 |
| Square root | 301.681952 (= 2√22753) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.1012 × |
91012 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand and twelve |
| Binary (base 2) | 10110001110000100 |
| Octal (base 8) | 261604 |
| Hexadecimal (base 16) | 16384 |
| Base 3 | 11121211211 |
| As time | 91012 seconds = 25 h 16 min 52 s |
Is 91012 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91012 ÷ 2 = 45506) | 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 | Yes (91012 ÷ 4 = 22753) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 91012 a prime number?
No. 91012 = × 61 × 373, so it is divisible by 2.
What are the factors of 91012?
1, 2, 4, 61, 122, 244, 373, 746, 1492, 22753, 45506, 91012.
What is 91012 in binary?
10110001110000100 (hexadecimal 16384, octal 261604).
What is the square root of 91012?
About 301.6820, exactly 2√22753.
Is 91012 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 91012?
It is a composite number with 12 divisors.