The number 51265
51265 is a composite number with 4 divisors. Its prime factorisation is 5 × 10253. Divisors (4): 1, 5, 10253, 51265.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51265: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 10253, the product of two primes.
- 2
51265 is composite. Its prime factorisation is
- 3
The divisors add up to 61524; without 51265 itself that is 10259, so 51265 is deficient (10259 is less than 51265). Euler's totient φ(51265) = 41008 numbers up to 51265 share no factor with it.
- 4
The digits of 51265 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51265 = 5 \times 10253 \]
51265 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 61524 |
| Euler totient φ(n) | 41008 |
| Square | 2628100225 |
| Cube | 134729558034625 |
| Square root | 226.417755 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1265 × |
51265 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and sixty-five |
| Binary (base 2) | 1100100001000001 |
| Octal (base 8) | 144101 |
| Hexadecimal (base 16) | C841 |
| Base 3 | 2121022201 |
| As time | 51265 seconds = 14 h 14 min 25 s |
Is 51265 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 | Yes (51265 ÷ 5 = 10253) | 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 4) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51265 a prime number?
No. 51265 = 5 × 10253, so it is divisible by 5.
What are the factors of 51265?
1, 5, 10253, 51265.
What is 51265 in binary?
1100100001000001 (hexadecimal C841, octal 144101).
What is the square root of 51265?
About 226.4178.
Is 51265 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 51265?
51265 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 10253, the product of two primes.