The number 75465
75465 is a binary palindrome (10010011011001001). Its prime factorisation is × 5 × 13 × 43. Divisors (32): 1, 3, 5, 9, 13, 15, 27, 39, 43, 45, 65, 117, 129, 135, 195, 215 … 75465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 75465: a binary palindrome (10010011011001001); a Harshad number: divisible by its digit sum 27.
- 2
75465 is composite. Its prime factorisation is
- 3
The divisors add up to 147840; without 75465 itself that is 72375, so 75465 is deficient (72375 is less than 75465). Euler's totient φ(75465) = 36288 numbers up to 75465 share no factor with it.
- 4
The digits of 75465 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 75465 = 3^{3} \times 5 \times 13 \times 43 \]75465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 147840 |
| Euler totient φ(n) | 36288 |
| Square | 5694966225 |
| Cube | 429770626169625 |
| Square root | 274.708937 (= 3√8385) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 107 |
| Scientific notation | 7.5465 × |
75465 in other forms
| Form | Value |
|---|---|
| In words | seventy-five thousand four hundred and sixty-five |
| Binary (base 2) | 10010011011001001 |
| Octal (base 8) | 223311 |
| Hexadecimal (base 16) | 126C9 |
| Base 3 | 10211112000 |
| As time | 75465 seconds = 20 h 57 min 45 s |
Is 75465 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 (75465 ÷ 3 = 25155) | 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 (75465 ÷ 5 = 15093) | 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 5) | 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 | Yes (75465 ÷ 9 = 8385) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 75465 a prime number?
No. 75465 = × 5 × 13 × 43, so it is divisible by 3.
What are the factors of 75465?
1, 3, 5, 9, 13, 15, 27, 39, 43, 45, 65, 117, 129, 135, 195, 215, 351, 387, 559, 585, 645, 1161, 1677, 1755, 1935, 2795, 5031, 5805, 8385, 15093, 25155, 75465.
What is 75465 in binary?
10010011011001001 (hexadecimal 126C9, octal 223311).
What is the square root of 75465?
About 274.7089, exactly 3√8385.
Is 75465 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 75465?
75465 is a binary palindrome (10010011011001001); a Harshad number: divisible by its digit sum 27.