The number 51201
51201 is a composite number with 6 divisors. Its prime factorisation is × 5689. Divisors (6): 1, 3, 9, 5689, 17067, 51201.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51201: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.
- 2
51201 is composite. Its prime factorisation is
- 3
The divisors add up to 73970; without 51201 itself that is 22769, so 51201 is deficient (22769 is less than 51201). Euler's totient φ(51201) = 34128 numbers up to 51201 share no factor with it.
- 4
The digits of 51201 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51201 = 3^{2} \times 5689 \]51201 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 73970 |
| Euler totient φ(n) | 34128 |
| Square | 2621542401 |
| Cube | 134225592473601 |
| Square root | 226.276380 (= 3√5689) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1201 × |
51201 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and one |
| Binary (base 2) | 1100100000000001 |
| Octal (base 8) | 144001 |
| Hexadecimal (base 16) | C801 |
| Base 3 | 2121020100 |
| As time | 51201 seconds = 14 h 13 min 21 s |
Is 51201 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 (51201 ÷ 3 = 17067) | 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 | Yes (51201 ÷ 9 = 5689) | 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 7) | 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 51201 a prime number?
No. 51201 = × 5689, so it is divisible by 3.
What are the factors of 51201?
1, 3, 9, 5689, 17067, 51201.
What is 51201 in binary?
1100100000000001 (hexadecimal C801, octal 144001).
What is the square root of 51201?
About 226.2764, exactly 3√5689.
Is 51201 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 51201?
51201 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.