The number 91473
91473 is a composite number with 4 divisors. Its prime factorisation is 3 × 30491. Divisors (4): 1, 3, 30491, 91473.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91473: a semiprime: 3 × 30491, the product of two primes.
- 2
91473 is composite. Its prime factorisation is
- 3
The divisors add up to 121968; without 91473 itself that is 30495, so 91473 is deficient (30495 is less than 91473). Euler's totient φ(91473) = 60980 numbers up to 91473 share no factor with it.
- 4
The digits of 91473 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 239 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91473 = 3 \times 30491 \]
91473 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 121968 |
| Euler totient φ(n) | 60980 |
| Square | 8367309729 |
| Cube | 765382922840817 |
| Square root | 302.445036 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 239 |
| Scientific notation | 9.1473 × |
91473 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand four hundred and seventy-three |
| Binary (base 2) | 10110010101010001 |
| Octal (base 8) | 262521 |
| Hexadecimal (base 16) | 16551 |
| Base 3 | 11122110220 |
| As time | 91473 seconds = 25 h 24 min 33 s |
Is 91473 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 (91473 ÷ 3 = 30491) | 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 91473 a prime number?
No. 91473 = 3 × 30491, so it is divisible by 3.
What are the factors of 91473?
1, 3, 30491, 91473.
What is 91473 in binary?
10110010101010001 (hexadecimal 16551, octal 262521).
What is the square root of 91473?
About 302.4450.
Is 91473 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 91473?
91473 is a semiprime: 3 × 30491, the product of two primes.