The number 90370
90370 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 7 × 1291. Divisors (16): 1, 2, 5, 7, 10, 14, 35, 70, 1291, 2582, 6455, 9037, 12910, 18074, 45185, 90370.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90370: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
90370 is composite. Its prime factorisation is
- 3
The divisors add up to 186048; without 90370 itself that is 95678, so 90370 is abundant (95678 is more than 90370). Euler's totient φ(90370) = 30960 numbers up to 90370 share no factor with it.
- 4
The digits of 90370 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 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90370 = 2 \times 5 \times 7 \times 1291 \]
90370 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 186048 |
| Euler totient φ(n) | 30960 |
| Square | 8166736900 |
| Cube | 738028013653000 |
| Square root | 300.616034 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 89 |
| Scientific notation | 9.037 × |
90370 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand three hundred and seventy |
| Binary (base 2) | 10110000100000010 |
| Octal (base 8) | 260402 |
| Hexadecimal (base 16) | 16102 |
| Base 3 | 11120222001 |
| As time | 90370 seconds = 25 h 6 min 10 s |
Is 90370 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90370 ÷ 2 = 45185) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (90370 ÷ 5 = 18074) | 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 | Yes (90370 ÷ 7 = 12910) | 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 2) | 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 (90370 ÷ 10 = 9037) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90370 a prime number?
No. 90370 = 2 × 5 × 7 × 1291, so it is divisible by 2.
What are the factors of 90370?
1, 2, 5, 7, 10, 14, 35, 70, 1291, 2582, 6455, 9037, 12910, 18074, 45185, 90370.
What is 90370 in binary?
10110000100000010 (hexadecimal 16102, octal 260402).
What is the square root of 90370?
About 300.6160.
Is 90370 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 90370?
90370 is a happy number: repeatedly adding the squares of its digits reaches 1.