The number 51207
51207 is a composite number with 12 divisors. Its prime factorisation is 3 × × 101. Divisors (12): 1, 3, 13, 39, 101, 169, 303, 507, 1313, 3939, 17069, 51207.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51207: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
51207 is composite. Its prime factorisation is
- 3
The divisors add up to 74664; without 51207 itself that is 23457, so 51207 is deficient (23457 is less than 51207). Euler's totient φ(51207) = 31200 numbers up to 51207 share no factor with it.
- 4
The digits of 51207 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51207 = 3 \times 13^{2} \times 101 \]51207 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 74664 |
| Euler totient φ(n) | 31200 |
| Square | 2622156849 |
| Cube | 134272785766743 |
| Square root | 226.289637 (= 13√303) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1207 × |
51207 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and seven |
| Binary (base 2) | 1100100000000111 |
| Octal (base 8) | 144007 |
| Hexadecimal (base 16) | C807 |
| Base 3 | 2121020120 |
| As time | 51207 seconds = 14 h 13 min 27 s |
Is 51207 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 (51207 ÷ 3 = 17069) | 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 2) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 2) | 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 51207 a prime number?
No. 51207 = 3 × × 101, so it is divisible by 3.
What are the factors of 51207?
1, 3, 13, 39, 101, 169, 303, 507, 1313, 3939, 17069, 51207.
What is 51207 in binary?
1100100000000111 (hexadecimal C807, octal 144007).
What is the square root of 51207?
About 226.2896, exactly 13√303.
Is 51207 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 51207?
51207 is a happy number: repeatedly adding the squares of its digits reaches 1.