The number 9301
9301 is a composite number with 4 divisors. Its prime factorisation is 71 × 131. Divisors (4): 1, 71, 131, 9301.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9301: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 71 × 131, the product of two primes.
- 2
9301 is composite. Its prime factorisation is
- 3
The divisors add up to 9504; without 9301 itself that is 203, so 9301 is deficient (203 is less than 9301). Euler's totient φ(9301) = 9100 numbers up to 9301 share no factor with it.
- 4
The digits of 9301 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 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9301 = 71 \times 131 \]
9301 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 9504 |
| Euler totient φ(n) | 9100 |
| Square | 86508601 |
| Cube | 804616497901 |
| Square root | 96.441692 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 122 |
| Scientific notation | 9.301 × |
9301 in other forms
| Form | Value |
|---|---|
| In words | nine thousand three hundred and one |
| Binary (base 2) | 10010001010101 |
| Octal (base 8) | 22125 |
| Hexadecimal (base 16) | 2455 |
| Base 3 | 110202111 |
| As time | 9301 seconds = 2 h 35 min 1 s |
Is 9301 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 5) | 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 6) | 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 9301 a prime number?
No. 9301 = 71 × 131, so it is divisible by 71.
What are the factors of 9301?
1, 71, 131, 9301.
What is 9301 in binary?
10010001010101 (hexadecimal 2455, octal 22125).
What is the square root of 9301?
About 96.4417.
Is 9301 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 9301?
9301 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 71 × 131, the product of two primes.