The number 46540
46540 is a composite number with 24 divisors. Its prime factorisation is × 5 × 13 × 179. Divisors (24): 1, 2, 4, 5, 10, 13, 20, 26, 52, 65, 130, 179, 260, 358, 716, 895 … 46540.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46540 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46540 is composite. Its prime factorisation is
- 3
The divisors add up to 105840; without 46540 itself that is 59300, so 46540 is abundant (59300 is more than 46540). Euler's totient φ(46540) = 17088 numbers up to 46540 share no factor with it.
- 4
The digits of 46540 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46540 = 2^{2} \times 5 \times 13 \times 179 \]46540 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 105840 |
| Euler totient φ(n) | 17088 |
| Square | 2165971600 |
| Cube | 100804318264000 |
| Square root | 215.731314 (= 2√11635) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.654 × |
46540 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand five hundred and forty |
| Binary (base 2) | 1011010111001100 |
| Octal (base 8) | 132714 |
| Hexadecimal (base 16) | B5CC |
| Base 3 | 2100211201 |
| As time | 46540 seconds = 12 h 55 min 40 s |
Is 46540 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46540 ÷ 2 = 23270) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (46540 ÷ 4 = 11635) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (46540 ÷ 5 = 9308) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (46540 ÷ 10 = 4654) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46540 a prime number?
No. 46540 = × 5 × 13 × 179, so it is divisible by 2.
What are the factors of 46540?
1, 2, 4, 5, 10, 13, 20, 26, 52, 65, 130, 179, 260, 358, 716, 895, 1790, 2327, 3580, 4654, 9308, 11635, 23270, 46540.
What is 46540 in binary?
1011010111001100 (hexadecimal B5CC, octal 132714).
What is the square root of 46540?
About 215.7313, exactly 2√11635.
Is 46540 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 46540?
It is a composite number with 24 divisors.