The number 90467
90467 is a composite number with 4 divisors. Its prime factorisation is 13 × 6959. Divisors (4): 1, 13, 6959, 90467.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90467: a semiprime: 13 × 6959, the product of two primes.
- 2
90467 is composite. Its prime factorisation is
- 3
The divisors add up to 97440; without 90467 itself that is 6973, so 90467 is deficient (6973 is less than 90467). Euler's totient φ(90467) = 83496 numbers up to 90467 share no factor with it.
- 4
The digits of 90467 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90467 = 13 \times 6959 \]
90467 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 97440 |
| Euler totient φ(n) | 83496 |
| Square | 8184278089 |
| Cube | 740407085877563 |
| Square root | 300.777326 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.0467 × |
90467 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand four hundred and sixty-seven |
| Binary (base 2) | 10110000101100011 |
| Octal (base 8) | 260543 |
| Hexadecimal (base 16) | 16163 |
| Base 3 | 11121002122 |
| As time | 90467 seconds = 25 h 7 min 47 s |
Is 90467 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 6) | 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 8) | 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 3) | 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 90467 a prime number?
No. 90467 = 13 × 6959, so it is divisible by 13.
What are the factors of 90467?
1, 13, 6959, 90467.
What is 90467 in binary?
10110000101100011 (hexadecimal 16163, octal 260543).
What is the square root of 90467?
About 300.7773.
Is 90467 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 90467?
90467 is a semiprime: 13 × 6959, the product of two primes.