The number 46841
46841 is a composite number with 4 divisors. Its prime factorisation is 31 × 1511. Divisors (4): 1, 31, 1511, 46841.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46841: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 31 × 1511, the product of two primes.
- 2
46841 is composite. Its prime factorisation is
- 3
The divisors add up to 48384; without 46841 itself that is 1543, so 46841 is deficient (1543 is less than 46841). Euler's totient φ(46841) = 45300 numbers up to 46841 share no factor with it.
- 4
The digits of 46841 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 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46841 = 31 \times 1511 \]
46841 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 48384 |
| Euler totient φ(n) | 45300 |
| Square | 2194079281 |
| Cube | 102772867601321 |
| Square root | 216.427817 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 176 |
| Scientific notation | 4.6841 × |
46841 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand eight hundred and forty-one |
| Binary (base 2) | 1011011011111001 |
| Octal (base 8) | 133371 |
| Hexadecimal (base 16) | B6F9 |
| Base 3 | 2101020212 |
| As time | 46841 seconds = 13 h 0 min 41 s |
Is 46841 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 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 | No (remainder 1) | 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 3) | 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 46841 a prime number?
No. 46841 = 31 × 1511, so it is divisible by 31.
What are the factors of 46841?
1, 31, 1511, 46841.
What is 46841 in binary?
1011011011111001 (hexadecimal B6F9, octal 133371).
What is the square root of 46841?
About 216.4278.
Is 46841 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 46841?
46841 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 31 × 1511, the product of two primes.