The number 46851
46851 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 23 × 97. Divisors (16): 1, 3, 7, 21, 23, 69, 97, 161, 291, 483, 679, 2037, 2231, 6693, 15617, 46851.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46851 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46851 is composite. Its prime factorisation is
- 3
The divisors add up to 75264; without 46851 itself that is 28413, so 46851 is deficient (28413 is less than 46851). Euler's totient φ(46851) = 25344 numbers up to 46851 share no factor with it.
- 4
The digits of 46851 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46851 = 3 \times 7 \times 23 \times 97 \]
46851 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 75264 |
| Euler totient φ(n) | 25344 |
| Square | 2195016201 |
| Cube | 102838704033051 |
| Square root | 216.450918 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 176 |
| Scientific notation | 4.6851 × |
46851 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand eight hundred and fifty-one |
| Binary (base 2) | 1011011100000011 |
| Octal (base 8) | 133403 |
| Hexadecimal (base 16) | B703 |
| Base 3 | 2101021020 |
| As time | 46851 seconds = 13 h 0 min 51 s |
Is 46851 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 | Yes (46851 ÷ 3 = 15617) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (46851 ÷ 7 = 6693) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46851 a prime number?
No. 46851 = 3 × 7 × 23 × 97, so it is divisible by 3.
What are the factors of 46851?
1, 3, 7, 21, 23, 69, 97, 161, 291, 483, 679, 2037, 2231, 6693, 15617, 46851.
What is 46851 in binary?
1011011100000011 (hexadecimal B703, octal 133403).
What is the square root of 46851?
About 216.4509.
Is 46851 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 46851?
It is a composite number with 16 divisors.