The number 90460
90460 is a composite number with 12 divisors. Its prime factorisation is × 5 × 4523. Divisors (12): 1, 2, 4, 5, 10, 20, 4523, 9046, 18092, 22615, 45230, 90460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90460: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
90460 is composite. Its prime factorisation is
- 3
The divisors add up to 190008; without 90460 itself that is 99548, so 90460 is abundant (99548 is more than 90460). Euler's totient φ(90460) = 36176 numbers up to 90460 share no factor with it.
- 4
The digits of 90460 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90460 = 2^{2} \times 5 \times 4523 \]90460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 190008 |
| Euler totient φ(n) | 36176 |
| Square | 8183011600 |
| Cube | 740235229336000 |
| Square root | 300.765690 (= 2√22615) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.046 × |
90460 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand four hundred and sixty |
| Binary (base 2) | 10110000101011100 |
| Octal (base 8) | 260534 |
| Hexadecimal (base 16) | 1615C |
| Base 3 | 11121002101 |
| As time | 90460 seconds = 25 h 7 min 40 s |
Is 90460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90460 ÷ 2 = 45230) | 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 (90460 ÷ 4 = 22615) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (90460 ÷ 5 = 18092) | 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 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (90460 ÷ 10 = 9046) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 90460 a prime number?
No. 90460 = × 5 × 4523, so it is divisible by 2.
What are the factors of 90460?
1, 2, 4, 5, 10, 20, 4523, 9046, 18092, 22615, 45230, 90460.
What is 90460 in binary?
10110000101011100 (hexadecimal 1615C, octal 260534).
What is the square root of 90460?
About 300.7657, exactly 2√22615.
Is 90460 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 90460?
90460 is a happy number: repeatedly adding the squares of its digits reaches 1.