The number 65469
65469 is a composite number with 8 divisors. Its prime factorisation is 3 × 139 × 157. Divisors (8): 1, 3, 139, 157, 417, 471, 21823, 65469.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
65469 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
65469 is composite. Its prime factorisation is
- 3
The divisors add up to 88480; without 65469 itself that is 23011, so 65469 is deficient (23011 is less than 65469). Euler's totient φ(65469) = 43056 numbers up to 65469 share no factor with it.
- 4
The digits of 65469 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 192 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65469 = 3 \times 139 \times 157 \]
65469 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 88480 |
| Euler totient φ(n) | 43056 |
| Square | 4286189961 |
| Cube | 280612570556709 |
| Square root | 255.869107 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 192 |
| Scientific notation | 6.5469 × |
65469 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand four hundred and sixty-nine |
| Binary (base 2) | 1111111110111101 |
| Octal (base 8) | 177675 |
| Hexadecimal (base 16) | FFBD |
| Base 3 | 10022210210 |
| As time | 65469 seconds = 18 h 11 min 9 s |
Is 65469 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 (65469 ÷ 3 = 21823) | 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 | No (remainder 4) | 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 5) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 65469 a prime number?
No. 65469 = 3 × 139 × 157, so it is divisible by 3.
What are the factors of 65469?
1, 3, 139, 157, 417, 471, 21823, 65469.
What is 65469 in binary?
1111111110111101 (hexadecimal FFBD, octal 177675).
What is the square root of 65469?
About 255.8691.
Is 65469 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 65469?
It is a composite number with 8 divisors.