The number 46041
46041 is a composite number with 8 divisors. Its prime factorisation is 3 × 103 × 149. Divisors (8): 1, 3, 103, 149, 309, 447, 15347, 46041.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46041 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46041 is composite. Its prime factorisation is
- 3
The divisors add up to 62400; without 46041 itself that is 16359, so 46041 is deficient (16359 is less than 46041). Euler's totient φ(46041) = 30192 numbers up to 46041 share no factor with it.
- 4
The digits of 46041 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46041 = 3 \times 103 \times 149 \]
46041 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 62400 |
| Euler totient φ(n) | 30192 |
| Square | 2119773681 |
| Cube | 97596500046921 |
| Square root | 214.571666 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 57 |
| Scientific notation | 4.6041 × |
46041 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand and forty-one |
| Binary (base 2) | 1011001111011001 |
| Octal (base 8) | 131731 |
| Hexadecimal (base 16) | B3D9 |
| Base 3 | 2100011020 |
| As time | 46041 seconds = 12 h 47 min 21 s |
Is 46041 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 (46041 ÷ 3 = 15347) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46041 a prime number?
No. 46041 = 3 × 103 × 149, so it is divisible by 3.
What are the factors of 46041?
1, 3, 103, 149, 309, 447, 15347, 46041.
What is 46041 in binary?
1011001111011001 (hexadecimal B3D9, octal 131731).
What is the square root of 46041?
About 214.5717.
Is 46041 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 46041?
It is a composite number with 8 divisors.