The number 46931
46931 is a composite number with 4 divisors. Its prime factorisation is 71 × 661. Divisors (4): 1, 71, 661, 46931.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46931: a semiprime: 71 × 661, the product of two primes.
- 2
46931 is composite. Its prime factorisation is
- 3
The divisors add up to 47664; without 46931 itself that is 733, so 46931 is deficient (733 is less than 46931). Euler's totient φ(46931) = 46200 numbers up to 46931 share no factor with it.
- 4
The digits of 46931 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 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46931 = 71 \times 661 \]
46931 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 47664 |
| Euler totient φ(n) | 46200 |
| Square | 2202518761 |
| Cube | 103366407972491 |
| Square root | 216.635639 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6931 × |
46931 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and thirty-one |
| Binary (base 2) | 1011011101010011 |
| Octal (base 8) | 133523 |
| Hexadecimal (base 16) | B753 |
| Base 3 | 2101101012 |
| As time | 46931 seconds = 13 h 2 min 11 s |
Is 46931 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 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 5) | 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 | No (remainder 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46931 a prime number?
No. 46931 = 71 × 661, so it is divisible by 71.
What are the factors of 46931?
1, 71, 661, 46931.
What is 46931 in binary?
1011011101010011 (hexadecimal B753, octal 133523).
What is the square root of 46931?
About 216.6356.
Is 46931 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 46931?
46931 is a semiprime: 71 × 661, the product of two primes.