The number 90470
90470 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 83 × 109. Divisors (16): 1, 2, 5, 10, 83, 109, 166, 218, 415, 545, 830, 1090, 9047, 18094, 45235, 90470.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90470 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90470 is composite. Its prime factorisation is
- 3
The divisors add up to 166320; without 90470 itself that is 75850, so 90470 is deficient (75850 is less than 90470). Euler's totient φ(90470) = 35424 numbers up to 90470 share no factor with it.
- 4
The digits of 90470 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90470 = 2 \times 5 \times 83 \times 109 \]
90470 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 166320 |
| Euler totient φ(n) | 35424 |
| Square | 8184820900 |
| Cube | 740480746823000 |
| Square root | 300.782313 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.047 × |
90470 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand four hundred and seventy |
| Binary (base 2) | 10110000101100110 |
| Octal (base 8) | 260546 |
| Hexadecimal (base 16) | 16166 |
| Base 3 | 11121002202 |
| As time | 90470 seconds = 25 h 7 min 50 s |
Is 90470 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90470 ÷ 2 = 45235) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (90470 ÷ 5 = 18094) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (90470 ÷ 10 = 9047) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90470 a prime number?
No. 90470 = 2 × 5 × 83 × 109, so it is divisible by 2.
What are the factors of 90470?
1, 2, 5, 10, 83, 109, 166, 218, 415, 545, 830, 1090, 9047, 18094, 45235, 90470.
What is 90470 in binary?
10110000101100110 (hexadecimal 16166, octal 260546).
What is the square root of 90470?
About 300.7823.
Is 90470 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 90470?
It is a composite number with 16 divisors.