The number 46891
46891 is a composite number with 4 divisors. Its prime factorisation is 13 × 3607. Divisors (4): 1, 13, 3607, 46891.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46891: a semiprime: 13 × 3607, the product of two primes.
- 2
46891 is composite. Its prime factorisation is
- 3
The divisors add up to 50512; without 46891 itself that is 3621, so 46891 is deficient (3621 is less than 46891). Euler's totient φ(46891) = 43272 numbers up to 46891 share no factor with it.
- 4
The digits of 46891 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 132 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46891 = 13 \times 3607 \]
46891 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50512 |
| Euler totient φ(n) | 43272 |
| Square | 2198765881 |
| Cube | 103102330925971 |
| Square root | 216.543298 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 132 |
| Scientific notation | 4.6891 × |
46891 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand eight hundred and ninety-one |
| Binary (base 2) | 1011011100101011 |
| Octal (base 8) | 133453 |
| Hexadecimal (base 16) | B72B |
| Base 3 | 2101022201 |
| As time | 46891 seconds = 13 h 1 min 31 s |
Is 46891 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 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 1) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46891 a prime number?
No. 46891 = 13 × 3607, so it is divisible by 13.
What are the factors of 46891?
1, 13, 3607, 46891.
What is 46891 in binary?
1011011100101011 (hexadecimal B72B, octal 133453).
What is the square root of 46891?
About 216.5433.
Is 46891 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 46891?
46891 is a semiprime: 13 × 3607, the product of two primes.