Base | Representation |
---|---|
bin | 1001110101010… |
… | …0101000110101 |
3 | 2212121021012200 |
4 | 2131110220311 |
5 | 41024204031 |
6 | 4031535113 |
7 | 1010354364 |
oct | 235245065 |
9 | 85537180 |
10 | 41241141 |
11 | 21309097 |
12 | 1198a499 |
13 | 870c756 |
14 | 56977db |
15 | 39498e6 |
hex | 2754a35 |
41241141 has 6 divisors (see below), whose sum is σ = 59570550. Its totient is φ = 27494088.
The previous prime is 41241127. The next prime is 41241157. The reversal of 41241141 is 14114214.
41241141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 25796241 + 15444900 = 5079^2 + 3930^2 .
It is not a de Polignac number, because 41241141 - 213 = 41232949 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41241181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2291166 + ... + 2291183.
It is an arithmetic number, because the mean of its divisors is an integer number (9928425).
Almost surely, 241241141 is an apocalyptic number.
It is an amenable number.
41241141 is a deficient number, since it is larger than the sum of its proper divisors (18329409).
41241141 is a wasteful number, since it uses less digits than its factorization.
41241141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4582355 (or 4582352 counting only the distinct ones).
The product of its digits is 128, while the sum is 18.
The square root of 41241141 is about 6421.9265800848. The cubic root of 41241141 is about 345.4964246026.
Adding to 41241141 its reverse (14114214), we get a palindrome (55355355).
The spelling of 41241141 in words is "forty-one million, two hundred forty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •