The number 51465
51465 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 47 × 73. Divisors (16): 1, 3, 5, 15, 47, 73, 141, 219, 235, 365, 705, 1095, 3431, 10293, 17155, 51465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51465: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
51465 is composite. Its prime factorisation is
- 3
The divisors add up to 85248; without 51465 itself that is 33783, so 51465 is deficient (33783 is less than 51465). Euler's totient φ(51465) = 26496 numbers up to 51465 share no factor with it.
- 4
The digits of 51465 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51465 = 3 \times 5 \times 47 \times 73 \]
51465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 85248 |
| Euler totient φ(n) | 26496 |
| Square | 2648646225 |
| Cube | 136312577969625 |
| Square root | 226.858987 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1465 × |
51465 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand four hundred and sixty-five |
| Binary (base 2) | 1100100100001001 |
| Octal (base 8) | 144411 |
| Hexadecimal (base 16) | C909 |
| Base 3 | 2121121010 |
| As time | 51465 seconds = 14 h 17 min 45 s |
Is 51465 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 (51465 ÷ 3 = 17155) | 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 (51465 ÷ 5 = 10293) | 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 1) | 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 5) | 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 51465 a prime number?
No. 51465 = 3 × 5 × 47 × 73, so it is divisible by 3.
What are the factors of 51465?
1, 3, 5, 15, 47, 73, 141, 219, 235, 365, 705, 1095, 3431, 10293, 17155, 51465.
What is 51465 in binary?
1100100100001001 (hexadecimal C909, octal 144411).
What is the square root of 51465?
About 226.8590.
Is 51465 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 51465?
51465 is a happy number: repeatedly adding the squares of its digits reaches 1.