The number 46904
46904 is a composite number with 32 divisors. Its prime factorisation is × 11 × 13 × 41. Divisors (32): 1, 2, 4, 8, 11, 13, 22, 26, 41, 44, 52, 82, 88, 104, 143, 164 … 46904.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46904 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46904 is composite. Its prime factorisation is
- 3
The divisors add up to 105840; without 46904 itself that is 58936, so 46904 is abundant (58936 is more than 46904). Euler's totient φ(46904) = 19200 numbers up to 46904 share no factor with it.
- 4
The digits of 46904 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 132 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46904 = 2^{3} \times 11 \times 13 \times 41 \]46904 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 105840 |
| Euler totient φ(n) | 19200 |
| Square | 2199985216 |
| Cube | 103188106571264 |
| Square root | 216.573313 (= 2√11726) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 132 |
| Scientific notation | 4.6904 × |
46904 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and four |
| Binary (base 2) | 1011011100111000 |
| Octal (base 8) | 133470 |
| Hexadecimal (base 16) | B738 |
| Base 3 | 2101100012 |
| As time | 46904 seconds = 13 h 1 min 44 s |
Is 46904 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46904 ÷ 2 = 23452) | 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 (46904 ÷ 4 = 11726) | 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 2) | 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 | Yes (46904 ÷ 8 = 5863) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 | Yes (46904 ÷ 11 = 4264) | 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 46904 a prime number?
No. 46904 = × 11 × 13 × 41, so it is divisible by 2.
What are the factors of 46904?
1, 2, 4, 8, 11, 13, 22, 26, 41, 44, 52, 82, 88, 104, 143, 164, 286, 328, 451, 533, 572, 902, 1066, 1144, 1804, 2132, 3608, 4264, 5863, 11726, 23452, 46904.
What is 46904 in binary?
1011011100111000 (hexadecimal B738, octal 133470).
What is the square root of 46904?
About 216.5733, exactly 2√11726.
Is 46904 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 46904?
It is a composite number with 32 divisors.