The number 52465
52465 is a composite number with 8 divisors. Its prime factorisation is 5 × 7 × 1499. Divisors (8): 1, 5, 7, 35, 1499, 7495, 10493, 52465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52465 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52465 is composite. Its prime factorisation is
- 3
The divisors add up to 72000; without 52465 itself that is 19535, so 52465 is deficient (19535 is less than 52465). Euler's totient φ(52465) = 35952 numbers up to 52465 share no factor with it.
- 4
The digits of 52465 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52465 = 5 \times 7 \times 1499 \]
52465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 72000 |
| Euler totient φ(n) | 35952 |
| Square | 2752576225 |
| Cube | 144413911644625 |
| Square root | 229.052396 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.2465 × |
52465 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand four hundred and sixty-five |
| Binary (base 2) | 1100110011110001 |
| Octal (base 8) | 146361 |
| Hexadecimal (base 16) | CCF1 |
| Base 3 | 2122222011 |
| As time | 52465 seconds = 14 h 34 min 25 s |
Is 52465 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 (52465 ÷ 5 = 10493) | 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 | Yes (52465 ÷ 7 = 7495) | 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 4) | 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 6) | 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 52465 a prime number?
No. 52465 = 5 × 7 × 1499, so it is divisible by 5.
What are the factors of 52465?
1, 5, 7, 35, 1499, 7495, 10493, 52465.
What is 52465 in binary?
1100110011110001 (hexadecimal CCF1, octal 146361).
What is the square root of 52465?
About 229.0524.
Is 52465 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 52465?
It is a composite number with 8 divisors.