The number 46961
46961 is a composite number with 4 divisors. Its prime factorisation is 151 × 311. Divisors (4): 1, 151, 311, 46961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46961: a semiprime: 151 × 311, the product of two primes.
- 2
46961 is composite. Its prime factorisation is
- 3
The divisors add up to 47424; without 46961 itself that is 463, so 46961 is deficient (463 is less than 46961). Euler's totient φ(46961) = 46500 numbers up to 46961 share no factor with it.
- 4
The digits of 46961 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46961 = 151 \times 311 \]
46961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 47424 |
| Euler totient φ(n) | 46500 |
| Square | 2205335521 |
| Cube | 103564761401681 |
| Square root | 216.704868 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6961 × |
46961 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and sixty-one |
| Binary (base 2) | 1011011101110001 |
| Octal (base 8) | 133561 |
| Hexadecimal (base 16) | B771 |
| Base 3 | 2101102022 |
| As time | 46961 seconds = 13 h 2 min 41 s |
Is 46961 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46961 a prime number?
No. 46961 = 151 × 311, so it is divisible by 151.
What are the factors of 46961?
1, 151, 311, 46961.
What is 46961 in binary?
1011011101110001 (hexadecimal B771, octal 133561).
What is the square root of 46961?
About 216.7049.
Is 46961 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 46961?
46961 is a semiprime: 151 × 311, the product of two primes.