The number 46505
46505 is a composite number with 8 divisors. Its prime factorisation is 5 × 71 × 131. Divisors (8): 1, 5, 71, 131, 355, 655, 9301, 46505.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46505 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46505 is composite. Its prime factorisation is
- 3
The divisors add up to 57024; without 46505 itself that is 10519, so 46505 is deficient (10519 is less than 46505). Euler's totient φ(46505) = 36400 numbers up to 46505 share no factor with it.
- 4
The digits of 46505 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46505 = 5 \times 71 \times 131 \]
46505 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 57024 |
| Euler totient φ(n) | 36400 |
| Square | 2162715025 |
| Cube | 100577062237625 |
| Square root | 215.650180 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.6505 × |
46505 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand five hundred and five |
| Binary (base 2) | 1011010110101001 |
| Octal (base 8) | 132651 |
| Hexadecimal (base 16) | B5A9 |
| Base 3 | 2100210102 |
| As time | 46505 seconds = 12 h 55 min 5 s |
Is 46505 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 (46505 ÷ 5 = 9301) | 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 4) | 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 2) | 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 8) | 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 46505 a prime number?
No. 46505 = 5 × 71 × 131, so it is divisible by 5.
What are the factors of 46505?
1, 5, 71, 131, 355, 655, 9301, 46505.
What is 46505 in binary?
1011010110101001 (hexadecimal B5A9, octal 132651).
What is the square root of 46505?
About 215.6502.
Is 46505 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 46505?
It is a composite number with 8 divisors.