The number 46565
46565 is a composite number with 8 divisors. Its prime factorisation is 5 × 67 × 139. Divisors (8): 1, 5, 67, 139, 335, 695, 9313, 46565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46565 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46565 is composite. Its prime factorisation is
- 3
The divisors add up to 57120; without 46565 itself that is 10555, so 46565 is deficient (10555 is less than 46565). Euler's totient φ(46565) = 36432 numbers up to 46565 share no factor with it.
- 4
The digits of 46565 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 132 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46565 = 5 \times 67 \times 139 \]
46565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 57120 |
| Euler totient φ(n) | 36432 |
| Square | 2168299225 |
| Cube | 100966853412125 |
| Square root | 215.789249 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 132 |
| Scientific notation | 4.6565 × |
46565 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand five hundred and sixty-five |
| Binary (base 2) | 1011010111100101 |
| Octal (base 8) | 132745 |
| Hexadecimal (base 16) | B5E5 |
| Base 3 | 2100212122 |
| As time | 46565 seconds = 12 h 56 min 5 s |
Is 46565 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 (46565 ÷ 5 = 9313) | 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 1) | 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 8) | 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 2) | 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 46565 a prime number?
No. 46565 = 5 × 67 × 139, so it is divisible by 5.
What are the factors of 46565?
1, 5, 67, 139, 335, 695, 9313, 46565.
What is 46565 in binary?
1011010111100101 (hexadecimal B5E5, octal 132745).
What is the square root of 46565?
About 215.7892.
Is 46565 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 46565?
It is a composite number with 8 divisors.