The number 90301
90301 is a composite number with 4 divisors. Its prime factorisation is 73 × 1237. Divisors (4): 1, 73, 1237, 90301.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90301: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 73 × 1237, the product of two primes.
- 2
90301 is composite. Its prime factorisation is
- 3
The divisors add up to 91612; without 90301 itself that is 1311, so 90301 is deficient (1311 is less than 90301). Euler's totient φ(90301) = 88992 numbers up to 90301 share no factor with it.
- 4
The digits of 90301 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90301 = 73 \times 1237 \]
90301 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 91612 |
| Euler totient φ(n) | 88992 |
| Square | 8154270601 |
| Cube | 736338789540901 |
| Square root | 300.501248 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.0301 × |
90301 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand three hundred and one |
| Binary (base 2) | 10110000010111101 |
| Octal (base 8) | 260275 |
| Hexadecimal (base 16) | 160BD |
| Base 3 | 11120212111 |
| As time | 90301 seconds = 25 h 5 min 1 s |
Is 90301 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 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90301 a prime number?
No. 90301 = 73 × 1237, so it is divisible by 73.
What are the factors of 90301?
1, 73, 1237, 90301.
What is 90301 in binary?
10110000010111101 (hexadecimal 160BD, octal 260275).
What is the square root of 90301?
About 300.5012.
Is 90301 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 90301?
90301 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 73 × 1237, the product of two primes.