The number 46141
46141 is the 4773rd prime number. Its only divisors are 1 and 46141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46141: the 4773rd prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
46141 is prime, so its only factors are 1 and 46141. It is the 4773rd prime; the next prime is 46147 and the one before is 46133.
- 3
The divisors add up to 46142; without 46141 itself that is 1, so 46141 is deficient (1 is less than 46141). Euler's totient φ(46141) = 46140 numbers up to 46141 share no factor with it.
- 4
The digits of 46141 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
46141 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 46142 |
| Euler totient φ(n) | 46140 |
| Square | 2128991881 |
| Cube | 98233814381221 |
| Square root | 214.804562 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 57 |
| Scientific notation | 4.6141 × |
46141 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand one hundred and forty-one |
| Binary (base 2) | 1011010000111101 |
| Octal (base 8) | 132075 |
| Hexadecimal (base 16) | B43D |
| Base 3 | 2100021221 |
| As time | 46141 seconds = 12 h 49 min 1 s |
Is 46141 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 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 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46141 a prime number?
Yes. 46141 is divisible only by 1 and itself.
What are the factors of 46141?
1, 46141.
What is 46141 in binary?
1011010000111101 (hexadecimal B43D, octal 132075).
What is the square root of 46141?
About 214.8046.
Is 46141 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 46141?
46141 is the 4773rd prime number; a happy number: repeatedly adding the squares of its digits reaches 1.