The number 90507
90507 is a composite number with 4 divisors. Its prime factorisation is 3 × 30169. Divisors (4): 1, 3, 30169, 90507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90507: a semiprime: 3 × 30169, the product of two primes.
- 2
90507 is composite. Its prime factorisation is
- 3
The divisors add up to 120680; without 90507 itself that is 30173, so 90507 is deficient (30173 is less than 90507). Euler's totient φ(90507) = 60336 numbers up to 90507 share no factor with it.
- 4
The digits of 90507 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90507 = 3 \times 30169 \]
90507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 120680 |
| Euler totient φ(n) | 60336 |
| Square | 8191517049 |
| Cube | 741389633553843 |
| Square root | 300.843813 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 89 |
| Scientific notation | 9.0507 × |
90507 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand five hundred and seven |
| Binary (base 2) | 10110000110001011 |
| Octal (base 8) | 260613 |
| Hexadecimal (base 16) | 1618B |
| Base 3 | 11121011010 |
| As time | 90507 seconds = 25 h 8 min 27 s |
Is 90507 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 (90507 ÷ 3 = 30169) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | 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 10) | 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 90507 a prime number?
No. 90507 = 3 × 30169, so it is divisible by 3.
What are the factors of 90507?
1, 3, 30169, 90507.
What is 90507 in binary?
10110000110001011 (hexadecimal 1618B, octal 260613).
What is the square root of 90507?
About 300.8438.
Is 90507 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 90507?
90507 is a semiprime: 3 × 30169, the product of two primes.