The number 90495
90495 is a composite number with 12 divisors. Its prime factorisation is × 5 × 2011. Divisors (12): 1, 3, 5, 9, 15, 45, 2011, 6033, 10055, 18099, 30165, 90495.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90495: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
90495 is composite. Its prime factorisation is
- 3
The divisors add up to 156936; without 90495 itself that is 66441, so 90495 is deficient (66441 is less than 90495). Euler's totient φ(90495) = 48240 numbers up to 90495 share no factor with it.
- 4
The digits of 90495 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 239 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90495 = 3^{2} \times 5 \times 2011 \]90495 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 156936 |
| Euler totient φ(n) | 48240 |
| Square | 8189345025 |
| Cube | 741094778037375 |
| Square root | 300.823869 (= 3√10055) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 239 |
| Scientific notation | 9.0495 × |
90495 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand four hundred and ninety-five |
| Binary (base 2) | 10110000101111111 |
| Octal (base 8) | 260577 |
| Hexadecimal (base 16) | 1617F |
| Base 3 | 11121010200 |
| As time | 90495 seconds = 25 h 8 min 15 s |
Is 90495 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 (90495 ÷ 3 = 30165) | 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 | Yes (90495 ÷ 5 = 18099) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (90495 ÷ 9 = 10055) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90495 a prime number?
No. 90495 = × 5 × 2011, so it is divisible by 3.
What are the factors of 90495?
1, 3, 5, 9, 15, 45, 2011, 6033, 10055, 18099, 30165, 90495.
What is 90495 in binary?
10110000101111111 (hexadecimal 1617F, octal 260577).
What is the square root of 90495?
About 300.8239, exactly 3√10055.
Is 90495 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 90495?
90495 is a happy number: repeatedly adding the squares of its digits reaches 1.