The number 41151
41151 is a composite number with 16 divisors. Its prime factorisation is 3 × 11 × 29 × 43. Divisors (16): 1, 3, 11, 29, 33, 43, 87, 129, 319, 473, 957, 1247, 1419, 3741, 13717, 41151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 41151: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
41151 is composite. Its prime factorisation is
- 3
The divisors add up to 63360; without 41151 itself that is 22209, so 41151 is deficient (22209 is less than 41151). Euler's totient φ(41151) = 23520 numbers up to 41151 share no factor with it.
- 4
The digits of 41151 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 142 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41151 = 3 \times 11 \times 29 \times 43 \]
41151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 63360 |
| Euler totient φ(n) | 23520 |
| Square | 1693404801 |
| Cube | 69685300965951 |
| Square root | 202.857093 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 142 |
| Scientific notation | 4.1151 × |
41151 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand one hundred and fifty-one |
| Binary (base 2) | 1010000010111111 |
| Octal (base 8) | 120277 |
| Hexadecimal (base 16) | A0BF |
| Base 3 | 2002110010 |
| As time | 41151 seconds = 11 h 25 min 51 s |
Is 41151 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 (41151 ÷ 3 = 13717) | 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 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 | Yes (41151 ÷ 11 = 3741) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 41151 a prime number?
No. 41151 = 3 × 11 × 29 × 43, so it is divisible by 3.
What are the factors of 41151?
1, 3, 11, 29, 33, 43, 87, 129, 319, 473, 957, 1247, 1419, 3741, 13717, 41151.
What is 41151 in binary?
1010000010111111 (hexadecimal A0BF, octal 120277).
What is the square root of 41151?
About 202.8571.
Is 41151 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 41151?
41151 is a happy number: repeatedly adding the squares of its digits reaches 1.