The number 9201
9201 is a binary palindrome (10001111110001). Its prime factorisation is 3 × 3067. Divisors (4): 1, 3, 3067, 9201.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9201: a binary palindrome (10001111110001); a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 3067, the product of two primes.
- 2
9201 is composite. Its prime factorisation is
- 3
The divisors add up to 12272; without 9201 itself that is 3071, so 9201 is deficient (3071 is less than 9201). Euler's totient φ(9201) = 6132 numbers up to 9201 share no factor with it.
- 4
The digits of 9201 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9201 = 3 \times 3067 \]
9201 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12272 |
| Euler totient φ(n) | 6132 |
| Square | 84658401 |
| Cube | 778941947601 |
| Square root | 95.921843 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 47 |
| Scientific notation | 9.201 × |
9201 in other forms
| Form | Value |
|---|---|
| In words | nine thousand two hundred and one |
| Binary (base 2) | 10001111110001 |
| Octal (base 8) | 21761 |
| Hexadecimal (base 16) | 23F1 |
| Base 3 | 110121210 |
| As time | 9201 seconds = 2 h 33 min 21 s |
Is 9201 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 (9201 ÷ 3 = 3067) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 1) | 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 1) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9201 a prime number?
No. 9201 = 3 × 3067, so it is divisible by 3.
What are the factors of 9201?
1, 3, 3067, 9201.
What is 9201 in binary?
10001111110001 (hexadecimal 23F1, octal 21761).
What is the square root of 9201?
About 95.9218.
Is 9201 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 9201?
9201 is a binary palindrome (10001111110001); a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 3067, the product of two primes.