The number 46504
46504 is a composite number with 8 divisors. Its prime factorisation is × 5813. Divisors (8): 1, 2, 4, 8, 5813, 11626, 23252, 46504.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46504 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46504 is composite. Its prime factorisation is
- 3
The divisors add up to 87210; without 46504 itself that is 40706, so 46504 is deficient (40706 is less than 46504). Euler's totient φ(46504) = 23248 numbers up to 46504 share no factor with it.
- 4
The digits of 46504 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 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46504 = 2^{3} \times 5813 \]46504 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 87210 |
| Euler totient φ(n) | 23248 |
| Square | 2162622016 |
| Cube | 100570574232064 |
| Square root | 215.647861 (= 2√11626) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.6504 × |
46504 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand five hundred and four |
| Binary (base 2) | 1011010110101000 |
| Octal (base 8) | 132650 |
| Hexadecimal (base 16) | B5A8 |
| Base 3 | 2100210101 |
| As time | 46504 seconds = 12 h 55 min 4 s |
Is 46504 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46504 ÷ 2 = 23252) | 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 (46504 ÷ 4 = 11626) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 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 | Yes (46504 ÷ 8 = 5813) | 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 | No (remainder 4) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46504 a prime number?
No. 46504 = × 5813, so it is divisible by 2.
What are the factors of 46504?
1, 2, 4, 8, 5813, 11626, 23252, 46504.
What is 46504 in binary?
1011010110101000 (hexadecimal B5A8, octal 132650).
What is the square root of 46504?
About 215.6479, exactly 2√11626.
Is 46504 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 46504?
It is a composite number with 8 divisors.