The number 46460
46460 is a composite number with 24 divisors. Its prime factorisation is × 5 × 23 × 101. Divisors (24): 1, 2, 4, 5, 10, 20, 23, 46, 92, 101, 115, 202, 230, 404, 460, 505 … 46460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46460: a Harshad number: divisible by its digit sum 20.
- 2
46460 is composite. Its prime factorisation is
- 3
The divisors add up to 102816; without 46460 itself that is 56356, so 46460 is abundant (56356 is more than 46460). Euler's totient φ(46460) = 17600 numbers up to 46460 share no factor with it.
- 4
The digits of 46460 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 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46460 = 2^{2} \times 5 \times 23 \times 101 \]46460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 102816 |
| Euler totient φ(n) | 17600 |
| Square | 2158531600 |
| Cube | 100285378136000 |
| Square root | 215.545819 (= 2√11615) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.646 × |
46460 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand four hundred and sixty |
| Binary (base 2) | 1011010101111100 |
| Octal (base 8) | 132574 |
| Hexadecimal (base 16) | B57C |
| Base 3 | 2100201202 |
| As time | 46460 seconds = 12 h 54 min 20 s |
Is 46460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46460 ÷ 2 = 23230) | 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 | Yes (46460 ÷ 4 = 11615) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (46460 ÷ 5 = 9292) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 4) | 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 | Yes (46460 ÷ 10 = 4646) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46460 a prime number?
No. 46460 = × 5 × 23 × 101, so it is divisible by 2.
What are the factors of 46460?
1, 2, 4, 5, 10, 20, 23, 46, 92, 101, 115, 202, 230, 404, 460, 505, 1010, 2020, 2323, 4646, 9292, 11615, 23230, 46460.
What is 46460 in binary?
1011010101111100 (hexadecimal B57C, octal 132574).
What is the square root of 46460?
About 215.5458, exactly 2√11615.
Is 46460 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 46460?
46460 is a Harshad number: divisible by its digit sum 20.