The number 65481
65481 is a composite number with 16 divisors. Its prime factorisation is 3 × 13 × 23 × 73. Divisors (16): 1, 3, 13, 23, 39, 69, 73, 219, 299, 897, 949, 1679, 2847, 5037, 21827, 65481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
65481 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
65481 is composite. Its prime factorisation is
- 3
The divisors add up to 99456; without 65481 itself that is 33975, so 65481 is deficient (33975 is less than 65481). Euler's totient φ(65481) = 38016 numbers up to 65481 share no factor with it.
- 4
The digits of 65481 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65481 = 3 \times 13 \times 23 \times 73 \]
65481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 99456 |
| Euler totient φ(n) | 38016 |
| Square | 4287761361 |
| Cube | 280766901679641 |
| Square root | 255.892556 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 73 |
| Scientific notation | 6.5481 × |
65481 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand four hundred and eighty-one |
| Binary (base 2) | 1111111111001001 |
| Octal (base 8) | 177711 |
| Hexadecimal (base 16) | FFC9 |
| Base 3 | 10022211020 |
| As time | 65481 seconds = 18 h 11 min 21 s |
Is 65481 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 (65481 ÷ 3 = 21827) | 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 1) | 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 3) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 65481 a prime number?
No. 65481 = 3 × 13 × 23 × 73, so it is divisible by 3.
What are the factors of 65481?
1, 3, 13, 23, 39, 69, 73, 219, 299, 897, 949, 1679, 2847, 5037, 21827, 65481.
What is 65481 in binary?
1111111111001001 (hexadecimal FFC9, octal 177711).
What is the square root of 65481?
About 255.8926.
Is 65481 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 65481?
It is a composite number with 16 divisors.