The number 53465
53465 is a composite number with 12 divisors. Its prime factorisation is 5 × × 37. Divisors (12): 1, 5, 17, 37, 85, 185, 289, 629, 1445, 3145, 10693, 53465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53465 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53465 is composite. Its prime factorisation is
- 3
The divisors add up to 69996; without 53465 itself that is 16531, so 53465 is deficient (16531 is less than 53465). Euler's totient φ(53465) = 39168 numbers up to 53465 share no factor with it.
- 4
The digits of 53465 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53465 = 5 \times 17^{2} \times 37 \]53465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 69996 |
| Euler totient φ(n) | 39168 |
| Square | 2858506225 |
| Cube | 152830035319625 |
| Square root | 231.224999 (= 17√185) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.3465 × |
53465 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand four hundred and sixty-five |
| Binary (base 2) | 1101000011011001 |
| Octal (base 8) | 150331 |
| Hexadecimal (base 16) | D0D9 |
| Base 3 | 2201100012 |
| As time | 53465 seconds = 14 h 51 min 5 s |
Is 53465 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 2) | 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 (53465 ÷ 5 = 10693) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 5) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53465 a prime number?
No. 53465 = 5 × × 37, so it is divisible by 5.
What are the factors of 53465?
1, 5, 17, 37, 85, 185, 289, 629, 1445, 3145, 10693, 53465.
What is 53465 in binary?
1101000011011001 (hexadecimal D0D9, octal 150331).
What is the square root of 53465?
About 231.2250, exactly 17√185.
Is 53465 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 53465?
It is a composite number with 12 divisors.